./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.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-31.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 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:14:04,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:14:04,688 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:14:04,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:14:04,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:14:04,714 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:14:04,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:14:04,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:14:04,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:14:04,715 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:14:04,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:14:04,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:14:04,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:14:04,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:14:04,715 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:14:04,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:14:04,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:14:04,716 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:14:04,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:14:04,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:14:04,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:14:04,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:14:04,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:14:04,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:14:04,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:14:04,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:14:04,717 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 -> 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c [2025-02-06 03:14:04,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:14:04,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:14:04,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:14:04,971 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:14:04,971 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:14:04,972 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-31.i [2025-02-06 03:14:06,045 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/209528490/9dd2e369f0384243bafc2fe1de319a19/FLAGf4a21e423 [2025-02-06 03:14:06,347 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:14:06,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2025-02-06 03:14:06,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/209528490/9dd2e369f0384243bafc2fe1de319a19/FLAGf4a21e423 [2025-02-06 03:14:06,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/209528490/9dd2e369f0384243bafc2fe1de319a19 [2025-02-06 03:14:06,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:14:06,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:14:06,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:14:06,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:14:06,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:14:06,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:14:06" (1/1) ... [2025-02-06 03:14:06,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f156c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:06, skipping insertion in model container [2025-02-06 03:14:06,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:14:06" (1/1) ... [2025-02-06 03:14:06,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:14:06,726 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-31.i[916,929] [2025-02-06 03:14:06,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:14:06,774 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:14:06,782 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-31.i[916,929] [2025-02-06 03:14:06,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:14:06,835 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:14:06,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:06 WrapperNode [2025-02-06 03:14:06,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:14:06,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:14:06,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:14:06,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:14:06,842 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:14:06" (1/1) ... [2025-02-06 03:14:06,851 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:14:06" (1/1) ... [2025-02-06 03:14:06,874 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2025-02-06 03:14:06,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:14:06,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:14:06,874 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:14:06,874 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:14:06,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:06" (1/1) ... [2025-02-06 03:14:06,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:06" (1/1) ... [2025-02-06 03:14:06,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:06" (1/1) ... [2025-02-06 03:14:06,897 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 20, 22, 33, 33]. 30 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 2, 4, 2]. The 16 writes are split as follows [0, 2, 5, 6, 3]. [2025-02-06 03:14:06,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:06" (1/1) ... [2025-02-06 03:14:06,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:06" (1/1) ... [2025-02-06 03:14:06,914 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:06" (1/1) ... [2025-02-06 03:14:06,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:06" (1/1) ... [2025-02-06 03:14:06,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:06" (1/1) ... [2025-02-06 03:14:06,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:06" (1/1) ... [2025-02-06 03:14:06,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:14:06,927 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:14:06,927 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:14:06,927 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:14:06,927 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:06" (1/1) ... [2025-02-06 03:14:06,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:14:06,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:14:06,962 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:14:06,972 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:14:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:14:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:14:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:14:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:14:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:14:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:14:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:14:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:14:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:14:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:14:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:14:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:14:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:14:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:14:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:14:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:14:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:14:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:14:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:14:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:14:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:14:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:14:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:14:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:14:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:14:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:14:06,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:14:06,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:14:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:14:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:14:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:14:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:14:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:14:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:14:06,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:14:07,088 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:14:07,090 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:14:07,409 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: havoc property_#t~mem59#1;havoc property_#t~ite71#1;havoc property_#t~mem63#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short81#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite91#1;havoc property_#t~ite88#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short110#1; [2025-02-06 03:14:07,444 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-02-06 03:14:07,445 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:14:07,453 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:14:07,454 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:14:07,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:14:07 BoogieIcfgContainer [2025-02-06 03:14:07,455 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:14:07,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:14:07,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:14:07,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:14:07,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:14:06" (1/3) ... [2025-02-06 03:14:07,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3b051b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:14:07, skipping insertion in model container [2025-02-06 03:14:07,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:06" (2/3) ... [2025-02-06 03:14:07,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3b051b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:14:07, skipping insertion in model container [2025-02-06 03:14:07,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:14:07" (3/3) ... [2025-02-06 03:14:07,462 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-31.i [2025-02-06 03:14:07,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:14:07,474 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-31.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:14:07,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:14:07,527 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;@2e853cb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:14:07,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:14:07,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:14:07,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:14:07,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:07,540 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:07,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:07,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:07,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1195198351, now seen corresponding path program 1 times [2025-02-06 03:14:07,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:07,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546202929] [2025-02-06 03:14:07,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:07,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:14:07,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:14:07,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:07,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 03:14:07,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:07,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546202929] [2025-02-06 03:14:07,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546202929] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:07,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880519126] [2025-02-06 03:14:07,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:07,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:14:07,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:14:07,731 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:14:07,733 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:14:07,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:14:07,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:14:07,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:07,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:07,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:14:07,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-06 03:14:07,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:07,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880519126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:07,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:07,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:14:07,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195658856] [2025-02-06 03:14:07,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:07,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:14:07,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:07,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:14:07,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:14:07,924 INFO L87 Difference]: Start difference. First operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:14:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:07,939 INFO L93 Difference]: Finished difference Result 166 states and 258 transitions. [2025-02-06 03:14:07,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:14:07,941 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-02-06 03:14:07,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:07,945 INFO L225 Difference]: With dead ends: 166 [2025-02-06 03:14:07,946 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 03:14:07,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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:14:07,950 INFO L435 NwaCegarLoop]: 121 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, 121 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:14:07,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:07,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 03:14:07,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-06 03:14:07,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:14:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2025-02-06 03:14:07,977 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 94 [2025-02-06 03:14:07,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:07,977 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2025-02-06 03:14:07,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:14:07,977 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2025-02-06 03:14:07,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:14:07,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:07,980 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:07,987 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:14:08,184 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:14:08,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:08,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:08,185 INFO L85 PathProgramCache]: Analyzing trace with hash -16814642, now seen corresponding path program 1 times [2025-02-06 03:14:08,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:08,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892585254] [2025-02-06 03:14:08,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:08,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:08,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:14:08,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:14:08,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:08,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:08,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:08,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892585254] [2025-02-06 03:14:08,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892585254] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:08,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:08,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:14:08,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792693633] [2025-02-06 03:14:08,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:08,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:14:08,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:08,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:14:08,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:14:08,785 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:14:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:08,852 INFO L93 Difference]: Finished difference Result 163 states and 239 transitions. [2025-02-06 03:14:08,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:14:08,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-02-06 03:14:08,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:08,854 INFO L225 Difference]: With dead ends: 163 [2025-02-06 03:14:08,854 INFO L226 Difference]: Without dead ends: 83 [2025-02-06 03:14:08,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:14:08,855 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:08,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 314 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:08,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-06 03:14:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-02-06 03:14:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:14:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2025-02-06 03:14:08,867 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 94 [2025-02-06 03:14:08,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:08,868 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2025-02-06 03:14:08,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:14:08,868 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2025-02-06 03:14:08,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:14:08,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:08,873 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:08,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:14:08,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:08,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:08,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1336495055, now seen corresponding path program 1 times [2025-02-06 03:14:08,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:08,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894480770] [2025-02-06 03:14:08,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:08,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:08,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:14:08,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:14:08,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:08,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:09,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:09,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894480770] [2025-02-06 03:14:09,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894480770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:09,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:09,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:14:09,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615857078] [2025-02-06 03:14:09,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:09,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:14:09,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:09,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:14:09,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:09,639 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:14:09,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:09,852 INFO L93 Difference]: Finished difference Result 222 states and 320 transitions. [2025-02-06 03:14:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:14:09,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-02-06 03:14:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:09,854 INFO L225 Difference]: With dead ends: 222 [2025-02-06 03:14:09,854 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 03:14:09,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:14:09,855 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 79 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:09,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 706 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:14:09,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 03:14:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2025-02-06 03:14:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 119 states have internal predecessors, (164), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:14:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 200 transitions. [2025-02-06 03:14:09,870 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 200 transitions. Word has length 94 [2025-02-06 03:14:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:09,870 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 200 transitions. [2025-02-06 03:14:09,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:14:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 200 transitions. [2025-02-06 03:14:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:14:09,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:09,871 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:09,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:14:09,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:09,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash -119724467, now seen corresponding path program 1 times [2025-02-06 03:14:09,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:09,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532089363] [2025-02-06 03:14:09,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:09,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:09,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:14:09,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:14:09,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:09,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:10,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:10,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532089363] [2025-02-06 03:14:10,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532089363] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:10,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:10,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:14:10,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336916831] [2025-02-06 03:14:10,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:10,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:14:10,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:10,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:14:10,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:14:10,012 INFO L87 Difference]: Start difference. First operand 139 states and 200 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:10,045 INFO L93 Difference]: Finished difference Result 275 states and 397 transitions. [2025-02-06 03:14:10,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:14:10,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-02-06 03:14:10,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:10,047 INFO L225 Difference]: With dead ends: 275 [2025-02-06 03:14:10,047 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 03:14:10,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:14:10,048 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:10,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 03:14:10,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-02-06 03:14:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 118 states have (on average 1.3728813559322033) internal successors, (162), 119 states have internal predecessors, (162), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:14:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 198 transitions. [2025-02-06 03:14:10,067 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 198 transitions. Word has length 96 [2025-02-06 03:14:10,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:10,068 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 198 transitions. [2025-02-06 03:14:10,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 198 transitions. [2025-02-06 03:14:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:14:10,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:10,069 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:10,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:14:10,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:10,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:10,071 INFO L85 PathProgramCache]: Analyzing trace with hash -316237972, now seen corresponding path program 1 times [2025-02-06 03:14:10,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:10,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509852173] [2025-02-06 03:14:10,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:10,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:10,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:14:10,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:14:10,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:10,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:11,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:11,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509852173] [2025-02-06 03:14:11,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509852173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:11,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:11,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:14:11,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691791162] [2025-02-06 03:14:11,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:11,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:14:11,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:11,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:14:11,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:14:11,183 INFO L87 Difference]: Start difference. First operand 139 states and 198 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-06 03:14:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:11,617 INFO L93 Difference]: Finished difference Result 307 states and 435 transitions. [2025-02-06 03:14:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:14:11,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2025-02-06 03:14:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:11,619 INFO L225 Difference]: With dead ends: 307 [2025-02-06 03:14:11,619 INFO L226 Difference]: Without dead ends: 171 [2025-02-06 03:14:11,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:14:11,620 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 164 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:11,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1226 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:14:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-06 03:14:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 113. [2025-02-06 03:14:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 93 states have internal predecessors, (123), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:14:11,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2025-02-06 03:14:11,634 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 96 [2025-02-06 03:14:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:11,635 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2025-02-06 03:14:11,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-06 03:14:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2025-02-06 03:14:11,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:14:11,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:11,636 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:11,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:14:11,636 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:11,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:11,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1028956590, now seen corresponding path program 1 times [2025-02-06 03:14:11,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:11,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852123720] [2025-02-06 03:14:11,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:11,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:11,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:14:11,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:14:11,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:11,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:11,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:11,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852123720] [2025-02-06 03:14:11,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852123720] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:11,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:11,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:11,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198718869] [2025-02-06 03:14:11,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:11,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:11,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:11,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:11,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:11,900 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:14:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:12,057 INFO L93 Difference]: Finished difference Result 249 states and 343 transitions. [2025-02-06 03:14:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:12,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2025-02-06 03:14:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:12,060 INFO L225 Difference]: With dead ends: 249 [2025-02-06 03:14:12,062 INFO L226 Difference]: Without dead ends: 159 [2025-02-06 03:14:12,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:12,063 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 110 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:12,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 520 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-06 03:14:12,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2025-02-06 03:14:12,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 133 states have internal predecessors, (174), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:14:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 214 transitions. [2025-02-06 03:14:12,091 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 214 transitions. Word has length 96 [2025-02-06 03:14:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:12,091 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 214 transitions. [2025-02-06 03:14:12,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:14:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 214 transitions. [2025-02-06 03:14:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 03:14:12,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:12,093 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:12,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:14:12,093 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:12,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:12,093 INFO L85 PathProgramCache]: Analyzing trace with hash 357986609, now seen corresponding path program 1 times [2025-02-06 03:14:12,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:12,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637325417] [2025-02-06 03:14:12,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:12,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:12,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 03:14:12,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 03:14:12,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:12,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:12,292 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:12,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:12,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637325417] [2025-02-06 03:14:12,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637325417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:12,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:12,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:12,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990047399] [2025-02-06 03:14:12,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:12,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:12,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:12,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:12,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:12,294 INFO L87 Difference]: Start difference. First operand 156 states and 214 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:14:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:12,423 INFO L93 Difference]: Finished difference Result 285 states and 386 transitions. [2025-02-06 03:14:12,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:12,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2025-02-06 03:14:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:12,425 INFO L225 Difference]: With dead ends: 285 [2025-02-06 03:14:12,425 INFO L226 Difference]: Without dead ends: 156 [2025-02-06 03:14:12,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:14:12,426 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 46 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:12,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 534 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-06 03:14:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 121. [2025-02-06 03:14:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 99 states have internal predecessors, (127), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:14:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 163 transitions. [2025-02-06 03:14:12,448 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 163 transitions. Word has length 97 [2025-02-06 03:14:12,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:12,448 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 163 transitions. [2025-02-06 03:14:12,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:14:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 163 transitions. [2025-02-06 03:14:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 03:14:12,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:12,451 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:12,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:14:12,451 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:12,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:12,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1798798884, now seen corresponding path program 1 times [2025-02-06 03:14:12,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:12,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099360852] [2025-02-06 03:14:12,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:12,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:12,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 03:14:12,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 03:14:12,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:12,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:12,813 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:12,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:12,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099360852] [2025-02-06 03:14:12,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099360852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:12,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:12,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:14:12,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31240348] [2025-02-06 03:14:12,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:12,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:14:12,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:12,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:14:12,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:12,814 INFO L87 Difference]: Start difference. First operand 121 states and 163 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:14:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:12,977 INFO L93 Difference]: Finished difference Result 304 states and 408 transitions. [2025-02-06 03:14:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:14:12,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-02-06 03:14:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:12,979 INFO L225 Difference]: With dead ends: 304 [2025-02-06 03:14:12,979 INFO L226 Difference]: Without dead ends: 210 [2025-02-06 03:14:12,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:14:12,980 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 91 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:12,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 804 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-06 03:14:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2025-02-06 03:14:13,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 172 states have (on average 1.302325581395349) internal successors, (224), 174 states have internal predecessors, (224), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 03:14:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 278 transitions. [2025-02-06 03:14:13,001 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 278 transitions. Word has length 98 [2025-02-06 03:14:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:13,001 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 278 transitions. [2025-02-06 03:14:13,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:14:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 278 transitions. [2025-02-06 03:14:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 03:14:13,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:13,002 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:13,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:14:13,003 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:13,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:13,003 INFO L85 PathProgramCache]: Analyzing trace with hash 70617194, now seen corresponding path program 1 times [2025-02-06 03:14:13,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:13,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295813356] [2025-02-06 03:14:13,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:13,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:13,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:14:13,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:14:13,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:13,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:14:13,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [951178195] [2025-02-06 03:14:13,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:13,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:14:13,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:14:13,047 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:14:13,054 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:14:13,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:14:13,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:14:13,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:13,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:13,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 03:14:13,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:13,431 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 25 treesize of output 13 [2025-02-06 03:14:13,487 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 13 [2025-02-06 03:14:13,622 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 25 [2025-02-06 03:14:13,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:13,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 78 treesize of output 47 [2025-02-06 03:14:13,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:13,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 69 treesize of output 41 [2025-02-06 03:14:13,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:13,774 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 66 treesize of output 22 [2025-02-06 03:14:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:13,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:13,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:13,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295813356] [2025-02-06 03:14:13,786 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 03:14:13,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951178195] [2025-02-06 03:14:13,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951178195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:13,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:13,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:14:13,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167744271] [2025-02-06 03:14:13,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:13,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:14:13,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:13,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:14:13,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:14:13,787 INFO L87 Difference]: Start difference. First operand 207 states and 278 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:13,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:13,998 INFO L93 Difference]: Finished difference Result 508 states and 685 transitions. [2025-02-06 03:14:13,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:14:13,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-02-06 03:14:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:14,000 INFO L225 Difference]: With dead ends: 508 [2025-02-06 03:14:14,001 INFO L226 Difference]: Without dead ends: 328 [2025-02-06 03:14:14,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:14:14,001 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 91 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:14,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 786 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:14:14,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-06 03:14:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 286. [2025-02-06 03:14:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 245 states have (on average 1.3142857142857143) internal successors, (322), 246 states have internal predecessors, (322), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-06 03:14:14,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 384 transitions. [2025-02-06 03:14:14,024 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 384 transitions. Word has length 99 [2025-02-06 03:14:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:14,024 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 384 transitions. [2025-02-06 03:14:14,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 384 transitions. [2025-02-06 03:14:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 03:14:14,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:14,025 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:14,034 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:14:14,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:14:14,226 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:14,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:14,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1283544114, now seen corresponding path program 1 times [2025-02-06 03:14:14,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:14,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653874227] [2025-02-06 03:14:14,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:14,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:14,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:14:14,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:14:14,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:14,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:14,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:14,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653874227] [2025-02-06 03:14:14,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653874227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:14,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:14,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:14,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123921741] [2025-02-06 03:14:14,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:14,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:14,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:14,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:14,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:14,405 INFO L87 Difference]: Start difference. First operand 286 states and 384 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:14,523 INFO L93 Difference]: Finished difference Result 631 states and 842 transitions. [2025-02-06 03:14:14,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:14:14,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-02-06 03:14:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:14,525 INFO L225 Difference]: With dead ends: 631 [2025-02-06 03:14:14,525 INFO L226 Difference]: Without dead ends: 445 [2025-02-06 03:14:14,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:14:14,526 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 71 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:14,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 781 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-02-06 03:14:14,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 306. [2025-02-06 03:14:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 265 states have (on average 1.320754716981132) internal successors, (350), 266 states have internal predecessors, (350), 31 states have call successors, (31), 9 states have call predecessors, (31), 9 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-06 03:14:14,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 412 transitions. [2025-02-06 03:14:14,548 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 412 transitions. Word has length 99 [2025-02-06 03:14:14,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:14,549 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 412 transitions. [2025-02-06 03:14:14,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:14,549 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 412 transitions. [2025-02-06 03:14:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 03:14:14,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:14,550 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:14,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:14:14,550 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:14,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:14,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1794078291, now seen corresponding path program 1 times [2025-02-06 03:14:14,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:14,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824259846] [2025-02-06 03:14:14,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:14,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:14,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:14:14,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:14:14,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:14,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:14,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:14,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824259846] [2025-02-06 03:14:14,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824259846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:14,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:14,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:14,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660528052] [2025-02-06 03:14:14,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:14,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:14,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:14,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:14,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:14,691 INFO L87 Difference]: Start difference. First operand 306 states and 412 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:14,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:14,841 INFO L93 Difference]: Finished difference Result 685 states and 913 transitions. [2025-02-06 03:14:14,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:14:14,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-02-06 03:14:14,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:14,844 INFO L225 Difference]: With dead ends: 685 [2025-02-06 03:14:14,844 INFO L226 Difference]: Without dead ends: 469 [2025-02-06 03:14:14,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:14:14,844 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 73 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:14,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 564 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-06 03:14:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 330. [2025-02-06 03:14:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 288 states have (on average 1.3229166666666667) internal successors, (381), 289 states have internal predecessors, (381), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-06 03:14:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 443 transitions. [2025-02-06 03:14:14,874 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 443 transitions. Word has length 99 [2025-02-06 03:14:14,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:14,874 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 443 transitions. [2025-02-06 03:14:14,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 443 transitions. [2025-02-06 03:14:14,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 03:14:14,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:14,875 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:14,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:14:14,875 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:14,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash -440768594, now seen corresponding path program 1 times [2025-02-06 03:14:14,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:14,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132806939] [2025-02-06 03:14:14,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:14,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:14,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:14:14,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:14:14,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:14,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:14,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:14:14,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132806939] [2025-02-06 03:14:14,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132806939] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:14,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:14,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:14:14,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613611205] [2025-02-06 03:14:14,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:14,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:14:14,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:14:14,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:14:14,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:14:14,988 INFO L87 Difference]: Start difference. First operand 330 states and 443 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:15,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:15,062 INFO L93 Difference]: Finished difference Result 633 states and 833 transitions. [2025-02-06 03:14:15,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:15,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-02-06 03:14:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:15,064 INFO L225 Difference]: With dead ends: 633 [2025-02-06 03:14:15,064 INFO L226 Difference]: Without dead ends: 403 [2025-02-06 03:14:15,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:15,065 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 86 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:15,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 379 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:15,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-02-06 03:14:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 306. [2025-02-06 03:14:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 264 states have (on average 1.2916666666666667) internal successors, (341), 265 states have internal predecessors, (341), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-02-06 03:14:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 403 transitions. [2025-02-06 03:14:15,090 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 403 transitions. Word has length 99 [2025-02-06 03:14:15,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:15,090 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 403 transitions. [2025-02-06 03:14:15,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 403 transitions. [2025-02-06 03:14:15,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:14:15,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:15,095 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:15,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:14:15,095 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:15,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1500137785, now seen corresponding path program 1 times [2025-02-06 03:14:15,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:14:15,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549344482] [2025-02-06 03:14:15,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:15,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:14:15,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:14:15,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:14:15,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:15,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:14:15,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1859965008] [2025-02-06 03:14:15,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:15,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:14:15,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:14:15,169 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:14:15,170 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:14:15,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:14:15,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:14:15,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:15,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:14:15,353 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:14:15,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:14:15,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:14:15,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:15,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:14:15,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:14:15,505 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:14:15,506 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:14:15,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:14:15,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:14:15,710 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:14:15,749 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:14:15,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:14:15 BoogieIcfgContainer [2025-02-06 03:14:15,751 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:14:15,752 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:14:15,752 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:14:15,752 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:14:15,752 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:14:07" (3/4) ... [2025-02-06 03:14:15,754 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:14:15,754 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:14:15,754 INFO L158 Benchmark]: Toolchain (without parser) took 9142.16ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 122.1MB in the beginning and 282.6MB in the end (delta: -160.5MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2025-02-06 03:14:15,755 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:14:15,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.94ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 107.6MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:14:15,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.76ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 104.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:14:15,755 INFO L158 Benchmark]: Boogie Preprocessor took 51.79ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 100.8MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:14:15,755 INFO L158 Benchmark]: IcfgBuilder took 527.97ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 71.6MB in the end (delta: 28.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:14:15,755 INFO L158 Benchmark]: TraceAbstraction took 8295.02ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 71.2MB in the beginning and 282.7MB in the end (delta: -211.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:14:15,755 INFO L158 Benchmark]: Witness Printer took 2.38ms. Allocated memory is still 343.9MB. Free memory was 282.7MB in the beginning and 282.6MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:14:15,756 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.16ms. Allocated memory is still 201.3MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.94ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 107.6MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.76ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 104.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.79ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 100.8MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 527.97ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 71.6MB in the end (delta: 28.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8295.02ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 71.2MB in the beginning and 282.7MB in the end (delta: -211.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.38ms. Allocated memory is still 343.9MB. Free memory was 282.7MB in the beginning and 282.6MB in the end (delta: 69.1kB). 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 someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 0.97, 32.6 }; [L25-L27] double double_Array_0[2] = { 0.97, 32.6 }; [L25-L27] double double_Array_0[2] = { 0.97, 32.6 }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L28-L30] signed long int signed_long_int_Array_0[2][2] = { {-32, 1107940323}, {4, 200} }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 64 }; [L34] double last_1_double_Array_0_0_ = 0.97; [L35] signed long int last_1_signed_long_int_Array_0_1__0_ = 4; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L94] EXPR double_Array_0[0] [L94] last_1_double_Array_0_0_ = double_Array_0[0] [L95] EXPR signed_long_int_Array_0[1][0] [L95] last_1_signed_long_int_Array_0_1__0_ = signed_long_int_Array_0[1][0] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7: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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7: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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] CALL assume_abort_if_not(BOOL_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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7: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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] RET assume_abort_if_not(BOOL_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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] EXPR BOOL_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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7: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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] double_Array_0[1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[1] [L82] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L82] EXPR double_Array_0[1] [L82] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7: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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] signed_long_int_Array_0[0][0] = __VERIFIER_nondet_long() [L84] EXPR signed_long_int_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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7: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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] RET assume_abort_if_not(signed_long_int_Array_0[0][0] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] EXPR signed_long_int_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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] CALL assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7: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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] RET assume_abort_if_not(signed_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] signed_long_int_Array_0[0][1] = __VERIFIER_nondet_long() [L87] EXPR 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7: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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_long_int_Array_0[0][1] >= 1073741822) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] EXPR 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] CALL assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7: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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] RET assume_abort_if_not(signed_long_int_Array_0[0][1] <= 2147483646) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L90] EXPR 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] CALL assume_abort_if_not(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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7: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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] RET assume_abort_if_not(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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] EXPR 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7: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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L106] RET updateVariables() [L107] CALL step() [L39] EXPR signed_long_int_Array_0[0][1] [L39] EXPR signed_long_int_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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L39] COND FALSE !(! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) [L46] EXPR unsigned_char_Array_0[0] [L46] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L48] EXPR unsigned_char_Array_0[1] [L48] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L48] COND FALSE !(unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR signed_long_int_Array_0[0][1] [L51] signed_long_int_Array_0[1][0] = (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]) [L53] EXPR unsigned_char_Array_0[1] [L53] EXPR signed_long_int_Array_0[0][1] [L53] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L53] COND FALSE !((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) [L64] EXPR double_Array_0[1] [L64] double_Array_0[0] = double_Array_0[1] [L66] BOOL_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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] COND TRUE BOOL_unsigned_char_Array_0[1] [L67] EXPR signed_long_int_Array_0[0][1] [L67] EXPR unsigned_char_Array_0[1] [L67] EXPR unsigned_char_Array_0[1] [L67] signed_long_int_Array_0[1][1] = ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]) [L107] RET step() [L108] CALL, EXPR property() [L98] EXPR BOOL_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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1) [L98] EXPR signed_long_int_Array_0[1][1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_double_Array_0_0_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1])))) [L98] EXPR unsigned_char_Array_0[1] [L98] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))) [L98] EXPR signed_long_int_Array_0[1][0] [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR (unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) [L98] EXPR signed_long_int_Array_0[0][1] [L98] EXPR signed_long_int_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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR unsigned_char_Array_0[0] [L98] EXPR (! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) [L98] EXPR unsigned_char_Array_0[1] [L98] EXPR signed_long_int_Array_0[0][1] [L98] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) [L98] EXPR double_Array_0[0] [L98] EXPR double_Array_0[1] [L98] EXPR ((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98] EXPR (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L98-L99] return (((BOOL_unsigned_char_Array_0[1] ? (signed_long_int_Array_0[1][1] == ((signed long int) ((signed_long_int_Array_0[0][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : ((BOOL_unsigned_char_Array_0[0] && (signed_long_int_Array_0[0][1] < unsigned_char_Array_0[1])) ? (signed_long_int_Array_0[1][1] == ((signed long int) signed_long_int_Array_0[0][1])) : 1)) && ((unsigned_char_Array_0[1] < unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] + unsigned_char_Array_0[1]))) : (signed_long_int_Array_0[1][0] == ((signed long int) (unsigned_char_Array_0[1] - signed_long_int_Array_0[0][1]))))) && ((! (signed_long_int_Array_0[0][1] < (signed_long_int_Array_0[0][0] * last_1_signed_long_int_Array_0_1__0_))) ? ((((((last_1_double_Array_0_0_) < 0 ) ? -(last_1_double_Array_0_0_) : (last_1_double_Array_0_0_))) < last_1_double_Array_0_0_) ? (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : 1) : 1) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) && (((unsigned_char_Array_0[1] + signed_long_int_Array_0[0][1]) < unsigned_char_Array_0[1]) ? ((BOOL_unsigned_char_Array_0[1] && BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (double_Array_0[0] == ((double) 0.8)) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) ; [L108] RET, EXPR property() [L108] 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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7: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_=97/100, last_1_signed_long_int_Array_0_1__0_=4, signed_long_int_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 13, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 818 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 811 mSDsluCounter, 6952 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5224 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1511 IncrementalHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 1728 mSDtfsCounter, 1511 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=330occurred in iteration=11, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 519 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1554 NumberOfCodeBlocks, 1554 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1242 ConstructedInterpolants, 0 QuantifiedInterpolants, 3896 SizeOfPredicates, 6 NumberOfNonLiveVariables, 717 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 2840/2860 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:14:15,782 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-31.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 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:14:17,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:14:17,892 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:14:17,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:14:17,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:14:17,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:14:17,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:14:17,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:14:17,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:14:17,928 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:14:17,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:14:17,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:14:17,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:14:17,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:14:17,929 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:14:17,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:14:17,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:14:17,929 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:14:17,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:14:17,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:14:17,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:14:17,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:14:17,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:14:17,932 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:14:17,932 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:14:17,932 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:14:17,932 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:14:17,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:14:17,932 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:14:17,932 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:14:17,932 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:14:17,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:14:17,933 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:14:17,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:14:17,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:14:17,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:14:17,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:14:17,933 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:14:17,934 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:14:17,934 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:14:17,934 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:14:17,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:14:17,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:14:17,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:14:17,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:14:17,934 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 -> 84da415e9ad0a7cbbc07d5b79a769caa1c0599f3ba39b8d5c5504fcb214f076c [2025-02-06 03:14:18,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:14:18,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:14:18,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:14:18,259 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:14:18,261 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:14:18,262 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-31.i [2025-02-06 03:14:19,422 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c09c68f5/39938b5fb9c34fea8a569adf2d9df2fb/FLAGde1672903 [2025-02-06 03:14:19,629 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:14:19,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-31.i [2025-02-06 03:14:19,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c09c68f5/39938b5fb9c34fea8a569adf2d9df2fb/FLAGde1672903 [2025-02-06 03:14:19,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c09c68f5/39938b5fb9c34fea8a569adf2d9df2fb [2025-02-06 03:14:19,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:14:19,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:14:19,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:14:19,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:14:19,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:14:19,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:14:19" (1/1) ... [2025-02-06 03:14:20,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cbfe4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:19, skipping insertion in model container [2025-02-06 03:14:20,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:14:19" (1/1) ... [2025-02-06 03:14:20,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:14:20,098 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-31.i[916,929] [2025-02-06 03:14:20,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:14:20,151 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:14:20,159 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-31.i[916,929] [2025-02-06 03:14:20,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:14:20,228 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:14:20,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:20 WrapperNode [2025-02-06 03:14:20,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:14:20,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:14:20,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:14:20,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:14:20,234 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:14:20" (1/1) ... [2025-02-06 03:14:20,243 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:14:20" (1/1) ... [2025-02-06 03:14:20,263 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 410 [2025-02-06 03:14:20,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:14:20,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:14:20,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:14:20,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:14:20,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:20" (1/1) ... [2025-02-06 03:14:20,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:20" (1/1) ... [2025-02-06 03:14:20,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:20" (1/1) ... [2025-02-06 03:14:20,296 INFO L175 MemorySlicer]: Split 110 memory accesses to 5 slices as follows [2, 20, 22, 33, 33]. 30 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 2, 4, 2]. The 16 writes are split as follows [0, 2, 5, 6, 3]. [2025-02-06 03:14:20,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:20" (1/1) ... [2025-02-06 03:14:20,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:20" (1/1) ... [2025-02-06 03:14:20,319 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:20" (1/1) ... [2025-02-06 03:14:20,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:20" (1/1) ... [2025-02-06 03:14:20,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:20" (1/1) ... [2025-02-06 03:14:20,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:20" (1/1) ... [2025-02-06 03:14:20,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:14:20,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:14:20,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:14:20,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:14:20,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:20" (1/1) ... [2025-02-06 03:14:20,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:14:20,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:14:20,349 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:14:20,351 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:14:20,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:14:20,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:14:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:14:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:14:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:14:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:14:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:14:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:14:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:14:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:14:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:14:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:14:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:14:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:14:20,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:14:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:14:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:14:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:14:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:14:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:14:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:14:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:14:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:14:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:14:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:14:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:14:20,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:14:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:14:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:14:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:14:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:14:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:14:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:14:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:14:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:14:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:14:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:14:20,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:14:20,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:14:20,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:14:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:14:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:14:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:14:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:14:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:14:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:14:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:14:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:14:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:14:20,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:14:20,462 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:14:20,463 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:14:20,963 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: havoc property_#t~mem59#1;havoc property_#t~ite71#1;havoc property_#t~mem63#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short81#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite91#1;havoc property_#t~ite88#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short110#1; [2025-02-06 03:14:20,988 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-02-06 03:14:20,989 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:14:21,030 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:14:21,030 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:14:21,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:14:21 BoogieIcfgContainer [2025-02-06 03:14:21,030 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:14:21,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:14:21,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:14:21,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:14:21,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:14:19" (1/3) ... [2025-02-06 03:14:21,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9449ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:14:21, skipping insertion in model container [2025-02-06 03:14:21,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:14:20" (2/3) ... [2025-02-06 03:14:21,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9449ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:14:21, skipping insertion in model container [2025-02-06 03:14:21,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:14:21" (3/3) ... [2025-02-06 03:14:21,037 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-31.i [2025-02-06 03:14:21,048 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:14:21,049 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-31.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:14:21,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:14:21,102 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;@59554d4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:14:21,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:14:21,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:14:21,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:14:21,115 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:21,116 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:21,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:21,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:21,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1195198351, now seen corresponding path program 1 times [2025-02-06 03:14:21,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:21,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324576495] [2025-02-06 03:14:21,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:21,134 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:14:21,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:21,141 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:14:21,142 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:14:21,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:14:21,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:14:21,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:21,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:21,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:14:21,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-06 03:14:21,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:21,418 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:21,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324576495] [2025-02-06 03:14:21,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324576495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:21,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:21,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:14:21,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40076316] [2025-02-06 03:14:21,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:21,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:14:21,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:21,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:14:21,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:14:21,438 INFO L87 Difference]: Start difference. First operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:14:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:21,452 INFO L93 Difference]: Finished difference Result 163 states and 253 transitions. [2025-02-06 03:14:21,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:14:21,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-02-06 03:14:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:21,458 INFO L225 Difference]: With dead ends: 163 [2025-02-06 03:14:21,458 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 03:14:21,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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:14:21,463 INFO L435 NwaCegarLoop]: 114 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, 114 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:14:21,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 03:14:21,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-06 03:14:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:14:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2025-02-06 03:14:21,500 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 94 [2025-02-06 03:14:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:21,500 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2025-02-06 03:14:21,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:14:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2025-02-06 03:14:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:14:21,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:21,509 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:21,516 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 (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:14:21,709 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:14:21,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:21,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:21,714 INFO L85 PathProgramCache]: Analyzing trace with hash -16814642, now seen corresponding path program 1 times [2025-02-06 03:14:21,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:21,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629484944] [2025-02-06 03:14:21,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:21,715 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:14:21,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:21,718 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:14:21,719 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:14:21,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:14:21,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:14:21,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:21,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:21,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:14:21,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:22,022 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:14:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:22,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:22,050 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:22,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629484944] [2025-02-06 03:14:22,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629484944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:22,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:22,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:14:22,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174930622] [2025-02-06 03:14:22,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:22,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:14:22,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:22,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:14:22,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:14:22,051 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:22,078 INFO L93 Difference]: Finished difference Result 157 states and 225 transitions. [2025-02-06 03:14:22,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:14:22,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-02-06 03:14:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:22,082 INFO L225 Difference]: With dead ends: 157 [2025-02-06 03:14:22,082 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 03:14:22,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:14:22,084 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:22,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 03:14:22,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-06 03:14:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 03:14:22,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2025-02-06 03:14:22,091 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 94 [2025-02-06 03:14:22,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:22,094 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2025-02-06 03:14:22,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2025-02-06 03:14:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-06 03:14:22,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:22,097 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:22,106 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:14:22,297 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:14:22,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:22,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:22,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1336495055, now seen corresponding path program 1 times [2025-02-06 03:14:22,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:22,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425021648] [2025-02-06 03:14:22,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:22,299 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:14:22,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:22,306 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:14:22,307 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:14:22,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 03:14:22,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 03:14:22,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:22,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:22,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:14:22,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:22,623 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:14:22,709 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 40 treesize of output 33 [2025-02-06 03:14:22,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:22,787 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 68 treesize of output 58 [2025-02-06 03:14:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-06 03:14:22,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:23,197 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:23,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425021648] [2025-02-06 03:14:23,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425021648] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:23,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:23,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-02-06 03:14:23,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749556317] [2025-02-06 03:14:23,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:23,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:14:23,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:23,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:14:23,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:14:23,202 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:23,616 INFO L93 Difference]: Finished difference Result 214 states and 302 transitions. [2025-02-06 03:14:23,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:14:23,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-02-06 03:14:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:23,618 INFO L225 Difference]: With dead ends: 214 [2025-02-06 03:14:23,618 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 03:14:23,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:14:23,619 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 75 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:23,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 479 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:14:23,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 03:14:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2025-02-06 03:14:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 114 states have internal predecessors, (153), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:14:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 189 transitions. [2025-02-06 03:14:23,632 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 189 transitions. Word has length 94 [2025-02-06 03:14:23,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:23,632 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 189 transitions. [2025-02-06 03:14:23,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 189 transitions. [2025-02-06 03:14:23,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:14:23,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:23,634 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:23,641 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 (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:14:23,838 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:14:23,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:23,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:23,839 INFO L85 PathProgramCache]: Analyzing trace with hash -119724467, now seen corresponding path program 1 times [2025-02-06 03:14:23,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:23,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077673838] [2025-02-06 03:14:23,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:23,839 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:14:23,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:23,842 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:14:23,844 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:14:23,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:14:24,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:14:24,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:24,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:24,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:14:24,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:24,040 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:14:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:24,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:24,057 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:24,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077673838] [2025-02-06 03:14:24,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077673838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:24,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:24,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:14:24,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180078237] [2025-02-06 03:14:24,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:24,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:14:24,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:24,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:14:24,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:14:24,059 INFO L87 Difference]: Start difference. First operand 134 states and 189 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:24,088 INFO L93 Difference]: Finished difference Result 265 states and 375 transitions. [2025-02-06 03:14:24,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:14:24,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-02-06 03:14:24,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:24,090 INFO L225 Difference]: With dead ends: 265 [2025-02-06 03:14:24,090 INFO L226 Difference]: Without dead ends: 134 [2025-02-06 03:14:24,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:14:24,091 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:24,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:14:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-06 03:14:24,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-02-06 03:14:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 113 states have (on average 1.336283185840708) internal successors, (151), 114 states have internal predecessors, (151), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:14:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2025-02-06 03:14:24,111 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 96 [2025-02-06 03:14:24,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:24,111 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2025-02-06 03:14:24,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2025-02-06 03:14:24,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:14:24,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:24,112 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:24,122 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:14:24,312 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:14:24,313 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:24,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:24,313 INFO L85 PathProgramCache]: Analyzing trace with hash -316237972, now seen corresponding path program 1 times [2025-02-06 03:14:24,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:24,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775884651] [2025-02-06 03:14:24,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:24,314 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:14:24,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:24,322 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:14:24,323 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:14:24,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:14:24,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:14:24,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:24,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:24,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:14:24,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:24,586 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:14:24,683 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 40 treesize of output 33 [2025-02-06 03:14:24,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:24,739 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 68 treesize of output 58 [2025-02-06 03:14:25,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:25,099 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 152 treesize of output 98 [2025-02-06 03:14:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-06 03:14:25,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:25,260 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:25,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775884651] [2025-02-06 03:14:25,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775884651] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:25,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:25,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2025-02-06 03:14:25,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379037574] [2025-02-06 03:14:25,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:25,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:25,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:25,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:25,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:14:25,261 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:25,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:25,543 INFO L93 Difference]: Finished difference Result 294 states and 411 transitions. [2025-02-06 03:14:25,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:25,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-02-06 03:14:25,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:25,544 INFO L225 Difference]: With dead ends: 294 [2025-02-06 03:14:25,544 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 03:14:25,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:14:25,551 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 82 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:25,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 541 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:14:25,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 03:14:25,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 110. [2025-02-06 03:14:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.303370786516854) internal successors, (116), 90 states have internal predecessors, (116), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:14:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 152 transitions. [2025-02-06 03:14:25,568 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 152 transitions. Word has length 96 [2025-02-06 03:14:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:25,569 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 152 transitions. [2025-02-06 03:14:25,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:25,569 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 152 transitions. [2025-02-06 03:14:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:14:25,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:25,573 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:25,581 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:14:25,773 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:14:25,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:25,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1028956590, now seen corresponding path program 1 times [2025-02-06 03:14:25,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:25,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308640570] [2025-02-06 03:14:25,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:25,777 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:14:25,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:25,779 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:14:25,780 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:14:25,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:14:25,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:14:25,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:25,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:25,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:14:25,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-02-06 03:14:26,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:26,161 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:26,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308640570] [2025-02-06 03:14:26,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308640570] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:26,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:26,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-02-06 03:14:26,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462257009] [2025-02-06 03:14:26,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:26,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:14:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:26,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:14:26,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:14:26,163 INFO L87 Difference]: Start difference. First operand 110 states and 152 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:26,253 INFO L93 Difference]: Finished difference Result 241 states and 325 transitions. [2025-02-06 03:14:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:14:26,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-02-06 03:14:26,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:26,256 INFO L225 Difference]: With dead ends: 241 [2025-02-06 03:14:26,257 INFO L226 Difference]: Without dead ends: 154 [2025-02-06 03:14:26,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:14:26,257 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 102 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:26,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 366 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:26,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-06 03:14:26,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2025-02-06 03:14:26,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 126 states have (on average 1.2936507936507937) internal successors, (163), 128 states have internal predecessors, (163), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:14:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 203 transitions. [2025-02-06 03:14:26,269 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 203 transitions. Word has length 96 [2025-02-06 03:14:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:26,269 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 203 transitions. [2025-02-06 03:14:26,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:26,272 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 203 transitions. [2025-02-06 03:14:26,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 03:14:26,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:26,275 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:26,285 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:14:26,476 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:14:26,476 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:26,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:26,477 INFO L85 PathProgramCache]: Analyzing trace with hash 357986609, now seen corresponding path program 1 times [2025-02-06 03:14:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:26,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373761064] [2025-02-06 03:14:26,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:26,477 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:14:26,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:26,479 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:14:26,481 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:14:26,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 03:14:26,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 03:14:26,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:26,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:26,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:14:26,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:26,830 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 33 treesize of output 15 [2025-02-06 03:14:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-02-06 03:14:26,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:26,927 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:26,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373761064] [2025-02-06 03:14:26,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373761064] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:26,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:26,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-02-06 03:14:26,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121364740] [2025-02-06 03:14:26,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:26,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:14:26,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:26,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:14:26,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:14:26,928 INFO L87 Difference]: Start difference. First operand 151 states and 203 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:27,006 INFO L93 Difference]: Finished difference Result 275 states and 364 transitions. [2025-02-06 03:14:27,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:14:27,007 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2025-02-06 03:14:27,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:27,008 INFO L225 Difference]: With dead ends: 275 [2025-02-06 03:14:27,008 INFO L226 Difference]: Without dead ends: 151 [2025-02-06 03:14:27,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:14:27,009 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 80 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:27,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 317 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-06 03:14:27,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 118. [2025-02-06 03:14:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.263157894736842) internal successors, (120), 96 states have internal predecessors, (120), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:14:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 156 transitions. [2025-02-06 03:14:27,020 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 156 transitions. Word has length 97 [2025-02-06 03:14:27,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:27,020 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 156 transitions. [2025-02-06 03:14:27,020 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 156 transitions. [2025-02-06 03:14:27,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-06 03:14:27,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:27,021 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:27,028 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:14:27,225 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:14:27,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:27,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:27,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1798798884, now seen corresponding path program 1 times [2025-02-06 03:14:27,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:27,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275103432] [2025-02-06 03:14:27,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:27,226 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:14:27,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:27,231 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:14:27,244 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:14:27,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 03:14:27,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 03:14:27,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:27,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:27,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:14:27,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:27,511 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:14:27,515 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 19 treesize of output 19 [2025-02-06 03:14:27,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:27,558 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 60 treesize of output 30 [2025-02-06 03:14:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:27,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:14:27,579 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:27,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275103432] [2025-02-06 03:14:27,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275103432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:14:27,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:14:27,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:14:27,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003790716] [2025-02-06 03:14:27,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:27,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:14:27,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:27,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:14:27,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:14:27,580 INFO L87 Difference]: Start difference. First operand 118 states and 156 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:14:27,743 INFO L93 Difference]: Finished difference Result 296 states and 390 transitions. [2025-02-06 03:14:27,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:14:27,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2025-02-06 03:14:27,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:14:27,744 INFO L225 Difference]: With dead ends: 296 [2025-02-06 03:14:27,744 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 03:14:27,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:14:27,745 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 87 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:14:27,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 655 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:14:27,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 03:14:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2025-02-06 03:14:27,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 167 states have (on average 1.2754491017964071) internal successors, (213), 169 states have internal predecessors, (213), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 03:14:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 267 transitions. [2025-02-06 03:14:27,758 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 267 transitions. Word has length 98 [2025-02-06 03:14:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:14:27,758 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 267 transitions. [2025-02-06 03:14:27,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 267 transitions. [2025-02-06 03:14:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 03:14:27,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:14:27,759 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:27,767 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 (9)] Ended with exit code 0 [2025-02-06 03:14:27,960 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:14:27,960 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:14:27,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:14:27,960 INFO L85 PathProgramCache]: Analyzing trace with hash 70617194, now seen corresponding path program 1 times [2025-02-06 03:14:27,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:14:27,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663736286] [2025-02-06 03:14:27,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:14:27,961 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:14:27,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:14:27,964 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:14:27,965 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:14:28,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:14:28,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:14:28,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:14:28,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:14:28,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 03:14:28,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:14:28,201 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 9 treesize of output 3 [2025-02-06 03:14:28,381 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:14:28,537 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 23 treesize of output 22 [2025-02-06 03:14:28,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:28,864 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 56 treesize of output 46 [2025-02-06 03:14:29,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:29,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 105 treesize of output 86 [2025-02-06 03:14:29,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:29,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 170 treesize of output 118 [2025-02-06 03:14:29,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:14:29,420 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 133 treesize of output 77 [2025-02-06 03:14:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 9 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-06 03:14:29,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:14:30,695 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:14:30,696 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:14:30,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663736286] [2025-02-06 03:14:30,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663736286] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:14:30,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:14:30,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2025-02-06 03:14:30,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298124617] [2025-02-06 03:14:30,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:14:30,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:14:30,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:14:30,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:14:30,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-02-06 03:14:30,698 INFO L87 Difference]: Start difference. First operand 202 states and 267 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:14:35,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 03:14:39,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 03:14:43,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 03:14:47,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 03:14:51,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 03:14:55,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:14:59,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 03:15:03,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-06 03:15:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:04,474 INFO L93 Difference]: Finished difference Result 451 states and 595 transitions. [2025-02-06 03:15:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:15:04,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-02-06 03:15:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:04,479 INFO L225 Difference]: With dead ends: 451 [2025-02-06 03:15:04,479 INFO L226 Difference]: Without dead ends: 276 [2025-02-06 03:15:04,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:15:04,480 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 262 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:04,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 502 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 8 Unknown, 0 Unchecked, 33.4s Time] [2025-02-06 03:15:04,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-02-06 03:15:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 224. [2025-02-06 03:15:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 189 states have (on average 1.2804232804232805) internal successors, (242), 191 states have internal predecessors, (242), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 03:15:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 296 transitions. [2025-02-06 03:15:04,502 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 296 transitions. Word has length 99 [2025-02-06 03:15:04,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:04,502 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 296 transitions. [2025-02-06 03:15:04,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 296 transitions. [2025-02-06 03:15:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 03:15:04,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:04,504 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:04,515 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 (10)] Ended with exit code 0 [2025-02-06 03:15:04,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:15:04,708 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:04,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:04,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1283544114, now seen corresponding path program 1 times [2025-02-06 03:15:04,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:04,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190759414] [2025-02-06 03:15:04,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:04,709 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:15:04,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:04,712 INFO L229 MonitoredProcess]: Starting monitored process 11 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:15:04,713 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 (11)] Waiting until timeout for monitored process [2025-02-06 03:15:04,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:15:04,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:15:04,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:04,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:04,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:15:04,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:04,903 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:15:04,970 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 40 treesize of output 33 [2025-02-06 03:15:04,974 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 26 treesize of output 20 [2025-02-06 03:15:05,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:05,025 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 57 treesize of output 27 [2025-02-06 03:15:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-06 03:15:05,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:05,090 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:05,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190759414] [2025-02-06 03:15:05,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190759414] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:05,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1084608243] [2025-02-06 03:15:05,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:05,091 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:15:05,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:15:05,093 INFO L229 MonitoredProcess]: Starting monitored process 12 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:15:05,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-02-06 03:15:05,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:15:05,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:15:05,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:05,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:05,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 03:15:05,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:05,760 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 15 treesize of output 15 [2025-02-06 03:15:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:05,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:05,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1084608243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:05,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:15:05,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2025-02-06 03:15:05,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294150023] [2025-02-06 03:15:05,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:05,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:15:05,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:05,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:15:05,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:15:05,832 INFO L87 Difference]: Start difference. First operand 224 states and 296 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:06,096 INFO L93 Difference]: Finished difference Result 549 states and 722 transitions. [2025-02-06 03:15:06,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:15:06,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-02-06 03:15:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:06,098 INFO L225 Difference]: With dead ends: 549 [2025-02-06 03:15:06,098 INFO L226 Difference]: Without dead ends: 352 [2025-02-06 03:15:06,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:15:06,099 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 129 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:06,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 649 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:15:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-06 03:15:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 235. [2025-02-06 03:15:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 200 states have (on average 1.285) internal successors, (257), 202 states have internal predecessors, (257), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 03:15:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 311 transitions. [2025-02-06 03:15:06,112 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 311 transitions. Word has length 99 [2025-02-06 03:15:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:06,113 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 311 transitions. [2025-02-06 03:15:06,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 311 transitions. [2025-02-06 03:15:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 03:15:06,114 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:06,114 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:06,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-02-06 03:15:06,325 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 (11)] Forceful destruction successful, exit code 0 [2025-02-06 03:15:06,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,11 /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:15:06,518 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:06,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:06,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1794078291, now seen corresponding path program 1 times [2025-02-06 03:15:06,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:06,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020539131] [2025-02-06 03:15:06,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:06,519 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:15:06,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:06,523 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:15:06,524 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:15:06,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:15:06,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:15:06,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:06,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:06,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:15:06,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:06,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:06,748 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:06,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020539131] [2025-02-06 03:15:06,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020539131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:06,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:06,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:15:06,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515735098] [2025-02-06 03:15:06,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:06,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:15:06,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:06,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:15:06,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:15:06,749 INFO L87 Difference]: Start difference. First operand 235 states and 311 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:06,986 INFO L93 Difference]: Finished difference Result 586 states and 771 transitions. [2025-02-06 03:15:06,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:15:06,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-02-06 03:15:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:06,988 INFO L225 Difference]: With dead ends: 586 [2025-02-06 03:15:06,988 INFO L226 Difference]: Without dead ends: 378 [2025-02-06 03:15:06,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 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:15:06,989 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 69 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:06,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 444 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:15:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2025-02-06 03:15:07,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 226. [2025-02-06 03:15:07,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.3015075376884422) internal successors, (259), 200 states have internal predecessors, (259), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:15:07,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 299 transitions. [2025-02-06 03:15:07,001 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 299 transitions. Word has length 99 [2025-02-06 03:15:07,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:07,002 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 299 transitions. [2025-02-06 03:15:07,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:07,002 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 299 transitions. [2025-02-06 03:15:07,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 03:15:07,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:07,003 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:07,013 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:15:07,207 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:15:07,207 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:07,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:07,208 INFO L85 PathProgramCache]: Analyzing trace with hash -440768594, now seen corresponding path program 1 times [2025-02-06 03:15:07,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:07,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675431141] [2025-02-06 03:15:07,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:07,208 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:15:07,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:07,210 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:15:07,211 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:15:07,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-06 03:15:07,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 03:15:07,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:07,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:07,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:15:07,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:07,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:07,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:07,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675431141] [2025-02-06 03:15:07,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675431141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:07,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:07,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:15:07,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326728871] [2025-02-06 03:15:07,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:07,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:15:07,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:07,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:15:07,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:15:07,409 INFO L87 Difference]: Start difference. First operand 226 states and 299 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:07,518 INFO L93 Difference]: Finished difference Result 502 states and 652 transitions. [2025-02-06 03:15:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:15:07,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-02-06 03:15:07,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:07,520 INFO L225 Difference]: With dead ends: 502 [2025-02-06 03:15:07,520 INFO L226 Difference]: Without dead ends: 279 [2025-02-06 03:15:07,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:15:07,521 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 39 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:07,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 472 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:15:07,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-06 03:15:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 208. [2025-02-06 03:15:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.2486187845303867) internal successors, (226), 182 states have internal predecessors, (226), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:15:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 266 transitions. [2025-02-06 03:15:07,532 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 266 transitions. Word has length 99 [2025-02-06 03:15:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:07,533 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 266 transitions. [2025-02-06 03:15:07,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 266 transitions. [2025-02-06 03:15:07,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:15:07,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:07,534 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:07,540 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 (14)] Forceful destruction successful, exit code 0 [2025-02-06 03:15:07,734 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:15:07,734 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:07,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:07,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1500137785, now seen corresponding path program 1 times [2025-02-06 03:15:07,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:07,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61964708] [2025-02-06 03:15:07,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:07,735 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:15:07,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:07,738 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:15:07,739 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:15:07,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:15:07,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:15:07,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:07,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:07,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 03:15:07,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:08,059 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 20 treesize of output 21 [2025-02-06 03:15:09,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:09,001 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 208 treesize of output 106 [2025-02-06 03:15:09,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:09,487 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 359 treesize of output 151 [2025-02-06 03:15:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-06 03:15:09,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:09,899 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:09,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61964708] [2025-02-06 03:15:09,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61964708] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:09,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1585132677] [2025-02-06 03:15:09,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:09,900 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:15:09,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:15:09,902 INFO L229 MonitoredProcess]: Starting monitored process 16 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:15:09,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2025-02-06 03:15:10,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:15:10,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:15:10,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:10,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:10,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 03:15:10,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:10,926 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 16 treesize of output 17 [2025-02-06 03:15:12,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:12,041 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 166 treesize of output 100 [2025-02-06 03:15:12,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:12,525 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 299 treesize of output 151 [2025-02-06 03:15:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-06 03:15:12,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:12,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1585132677] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:12,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:15:12,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2025-02-06 03:15:12,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192314626] [2025-02-06 03:15:12,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:15:12,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 03:15:12,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:12,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 03:15:12,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:15:12,712 INFO L87 Difference]: Start difference. First operand 208 states and 266 transitions. Second operand has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-06 03:15:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:15,512 INFO L93 Difference]: Finished difference Result 542 states and 684 transitions. [2025-02-06 03:15:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:15:15,513 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 100 [2025-02-06 03:15:15,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:15,515 INFO L225 Difference]: With dead ends: 542 [2025-02-06 03:15:15,515 INFO L226 Difference]: Without dead ends: 540 [2025-02-06 03:15:15,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2025-02-06 03:15:15,518 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 554 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:15,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 1014 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 03:15:15,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-06 03:15:15,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 532. [2025-02-06 03:15:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 467 states have (on average 1.23982869379015) internal successors, (579), 473 states have internal predecessors, (579), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:15:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 675 transitions. [2025-02-06 03:15:15,573 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 675 transitions. Word has length 100 [2025-02-06 03:15:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:15,574 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 675 transitions. [2025-02-06 03:15:15,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 17 states have internal predecessors, (97), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-02-06 03:15:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 675 transitions. [2025-02-06 03:15:15,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:15:15,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:15,575 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:15,584 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 (15)] Forceful destruction successful, exit code 0 [2025-02-06 03:15:15,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2025-02-06 03:15:15,976 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,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:15:15,976 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:15,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:15,977 INFO L85 PathProgramCache]: Analyzing trace with hash 998966216, now seen corresponding path program 1 times [2025-02-06 03:15:15,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:15,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63506419] [2025-02-06 03:15:15,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:15,977 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:15:15,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:15,979 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:15:15,980 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:15:16,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:15:16,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:15:16,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:16,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:16,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:15:16,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:16,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:16,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:16,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63506419] [2025-02-06 03:15:16,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63506419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:16,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:16,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:15:16,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928271279] [2025-02-06 03:15:16,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:16,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:15:16,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:16,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:15:16,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:15:16,291 INFO L87 Difference]: Start difference. First operand 532 states and 675 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:16,353 INFO L93 Difference]: Finished difference Result 1070 states and 1359 transitions. [2025-02-06 03:15:16,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:15:16,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2025-02-06 03:15:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:16,356 INFO L225 Difference]: With dead ends: 1070 [2025-02-06 03:15:16,356 INFO L226 Difference]: Without dead ends: 541 [2025-02-06 03:15:16,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:15:16,357 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:16,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-02-06 03:15:16,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 532. [2025-02-06 03:15:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 467 states have (on average 1.2334047109207709) internal successors, (576), 473 states have internal predecessors, (576), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:15:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 672 transitions. [2025-02-06 03:15:16,394 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 672 transitions. Word has length 100 [2025-02-06 03:15:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:16,394 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 672 transitions. [2025-02-06 03:15:16,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 672 transitions. [2025-02-06 03:15:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 03:15:16,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:16,395 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:16,403 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:15:16,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:15:16,600 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:16,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:16,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1016462458, now seen corresponding path program 1 times [2025-02-06 03:15:16,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:16,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680285962] [2025-02-06 03:15:16,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:16,602 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:15:16,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:16,604 INFO L229 MonitoredProcess]: Starting monitored process 18 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:15:16,605 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 (18)] Waiting until timeout for monitored process [2025-02-06 03:15:16,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-06 03:15:16,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 03:15:16,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:16,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:16,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:15:16,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-06 03:15:16,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:16,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:16,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680285962] [2025-02-06 03:15:16,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680285962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:16,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:16,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:15:16,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900692714] [2025-02-06 03:15:16,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:16,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:15:16,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:16,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:15:16,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:15:16,787 INFO L87 Difference]: Start difference. First operand 532 states and 672 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:15:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:16,855 INFO L93 Difference]: Finished difference Result 1061 states and 1341 transitions. [2025-02-06 03:15:16,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:15:16,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2025-02-06 03:15:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:16,858 INFO L225 Difference]: With dead ends: 1061 [2025-02-06 03:15:16,858 INFO L226 Difference]: Without dead ends: 532 [2025-02-06 03:15:16,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 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:15:16,861 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 316 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:15:16,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 316 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:15:16,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-06 03:15:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-06 03:15:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 467 states have (on average 1.2291220556745182) internal successors, (574), 473 states have internal predecessors, (574), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:15:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 670 transitions. [2025-02-06 03:15:16,902 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 670 transitions. Word has length 100 [2025-02-06 03:15:16,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:16,902 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 670 transitions. [2025-02-06 03:15:16,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-06 03:15:16,903 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 670 transitions. [2025-02-06 03:15:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 03:15:16,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:16,904 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:16,910 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 (18)] Ended with exit code 0 [2025-02-06 03:15:17,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:15:17,105 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:17,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:17,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1588269928, now seen corresponding path program 1 times [2025-02-06 03:15:17,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:17,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752662286] [2025-02-06 03:15:17,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:17,106 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:15:17,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:17,108 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:15:17,109 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:15:17,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:15:17,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:15:17,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:17,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:17,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:15:17,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:17,337 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 9 treesize of output 3 [2025-02-06 03:15:17,398 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:15:17,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:17,603 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 56 treesize of output 46 [2025-02-06 03:15:17,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:17,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 84 treesize of output 71 [2025-02-06 03:15:17,760 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 119 treesize of output 89 [2025-02-06 03:15:18,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:18,132 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 105 treesize of output 55 [2025-02-06 03:15:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 108 proven. 9 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-06 03:15:18,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:18,756 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:18,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752662286] [2025-02-06 03:15:18,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752662286] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:18,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:15:18,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-02-06 03:15:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599765558] [2025-02-06 03:15:18,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:18,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:15:18,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:18,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:15:18,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:15:18,757 INFO L87 Difference]: Start difference. First operand 532 states and 670 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:23,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:15:27,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:15:27,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:27,685 INFO L93 Difference]: Finished difference Result 1145 states and 1438 transitions. [2025-02-06 03:15:27,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:15:27,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2025-02-06 03:15:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:27,691 INFO L225 Difference]: With dead ends: 1145 [2025-02-06 03:15:27,691 INFO L226 Difference]: Without dead ends: 616 [2025-02-06 03:15:27,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:15:27,692 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 40 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:27,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 459 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2025-02-06 03:15:27,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-02-06 03:15:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 515. [2025-02-06 03:15:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 450 states have (on average 1.22) internal successors, (549), 456 states have internal predecessors, (549), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:15:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 645 transitions. [2025-02-06 03:15:27,722 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 645 transitions. Word has length 101 [2025-02-06 03:15:27,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:27,722 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 645 transitions. [2025-02-06 03:15:27,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:27,723 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 645 transitions. [2025-02-06 03:15:27,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 03:15:27,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:27,723 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:27,732 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:15:27,924 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:15:27,925 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:27,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:27,925 INFO L85 PathProgramCache]: Analyzing trace with hash -507597641, now seen corresponding path program 1 times [2025-02-06 03:15:27,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:27,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753301711] [2025-02-06 03:15:27,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:27,925 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:15:27,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:27,927 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:15:27,929 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:15:28,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 03:15:28,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 03:15:28,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:28,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:28,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:15:28,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:28,209 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 30 treesize of output 1 [2025-02-06 03:15:28,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:28,691 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 186 treesize of output 96 [2025-02-06 03:15:29,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:29,012 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 382 treesize of output 132 [2025-02-06 03:15:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:15:29,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:29,388 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753301711] [2025-02-06 03:15:29,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753301711] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2042421171] [2025-02-06 03:15:29,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:29,389 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:15:29,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:15:29,391 INFO L229 MonitoredProcess]: Starting monitored process 21 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:15:29,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2025-02-06 03:15:29,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 03:15:30,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 03:15:30,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:30,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:30,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 03:15:30,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:30,368 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:15:35,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:35,347 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:15:35,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:35,802 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 316 treesize of output 136 [2025-02-06 03:15:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 03:15:35,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:15:35,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2042421171] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:15:35,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:15:35,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2025-02-06 03:15:35,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703905009] [2025-02-06 03:15:35,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:15:35,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 03:15:35,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:35,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 03:15:35,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=756, Unknown=1, NotChecked=0, Total=870 [2025-02-06 03:15:35,970 INFO L87 Difference]: Start difference. First operand 515 states and 645 transitions. Second operand has 25 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-02-06 03:15:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:39,025 INFO L93 Difference]: Finished difference Result 869 states and 1073 transitions. [2025-02-06 03:15:39,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 03:15:39,026 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 102 [2025-02-06 03:15:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:39,031 INFO L225 Difference]: With dead ends: 869 [2025-02-06 03:15:39,032 INFO L226 Difference]: Without dead ends: 867 [2025-02-06 03:15:39,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=394, Invalid=1861, Unknown=1, NotChecked=0, Total=2256 [2025-02-06 03:15:39,033 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 561 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:39,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1217 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 03:15:39,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-02-06 03:15:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 703. [2025-02-06 03:15:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 610 states have (on average 1.2180327868852459) internal successors, (743), 619 states have internal predecessors, (743), 68 states have call successors, (68), 24 states have call predecessors, (68), 24 states have return successors, (68), 59 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-06 03:15:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 879 transitions. [2025-02-06 03:15:39,099 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 879 transitions. Word has length 102 [2025-02-06 03:15:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:39,099 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 879 transitions. [2025-02-06 03:15:39,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 22 states have internal predecessors, (107), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-02-06 03:15:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 879 transitions. [2025-02-06 03:15:39,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 03:15:39,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:39,101 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:39,113 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 (20)] Ended with exit code 0 [2025-02-06 03:15:39,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2025-02-06 03:15:39,505 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,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:15:39,505 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:39,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:39,505 INFO L85 PathProgramCache]: Analyzing trace with hash 446631254, now seen corresponding path program 1 times [2025-02-06 03:15:39,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:39,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456507494] [2025-02-06 03:15:39,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:39,506 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:15:39,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:39,510 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:15:39,515 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:15:39,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 03:15:39,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 03:15:39,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:39,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:39,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:15:39,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-02-06 03:15:39,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:39,744 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:39,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456507494] [2025-02-06 03:15:39,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456507494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:39,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:39,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:15:39,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847047640] [2025-02-06 03:15:39,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:39,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:15:39,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:39,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:15:39,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:15:39,745 INFO L87 Difference]: Start difference. First operand 703 states and 879 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-06 03:15:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:39,910 INFO L93 Difference]: Finished difference Result 1263 states and 1567 transitions. [2025-02-06 03:15:39,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:15:39,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2025-02-06 03:15:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:39,912 INFO L225 Difference]: With dead ends: 1263 [2025-02-06 03:15:39,912 INFO L226 Difference]: Without dead ends: 551 [2025-02-06 03:15:39,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 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:15:39,914 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:39,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:15:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-02-06 03:15:39,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 523. [2025-02-06 03:15:39,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 456 states have (on average 1.212719298245614) internal successors, (553), 462 states have internal predecessors, (553), 48 states have call successors, (48), 18 states have call predecessors, (48), 18 states have return successors, (48), 42 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 03:15:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 649 transitions. [2025-02-06 03:15:39,951 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 649 transitions. Word has length 102 [2025-02-06 03:15:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:39,952 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 649 transitions. [2025-02-06 03:15:39,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-06 03:15:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 649 transitions. [2025-02-06 03:15:39,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:39,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:39,953 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:39,963 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:15:40,153 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:15:40,154 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:40,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:40,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2140942666, now seen corresponding path program 1 times [2025-02-06 03:15:40,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:40,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359995110] [2025-02-06 03:15:40,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:40,155 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:15:40,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:40,160 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:15:40,161 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:15:40,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:40,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:40,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:40,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:40,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:15:40,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:40,475 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 60 treesize of output 53 [2025-02-06 03:15:40,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:40,813 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 65 treesize of output 41 [2025-02-06 03:15:40,816 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 18 [2025-02-06 03:15:40,853 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:40,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:40,853 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:40,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359995110] [2025-02-06 03:15:40,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359995110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:40,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:40,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:15:40,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108456224] [2025-02-06 03:15:40,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:40,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:15:40,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:40,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:15:40,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:15:40,856 INFO L87 Difference]: Start difference. First operand 523 states and 649 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:41,553 INFO L93 Difference]: Finished difference Result 1542 states and 1893 transitions. [2025-02-06 03:15:41,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:15:41,553 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-02-06 03:15:41,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:41,556 INFO L225 Difference]: With dead ends: 1542 [2025-02-06 03:15:41,556 INFO L226 Difference]: Without dead ends: 1022 [2025-02-06 03:15:41,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:15:41,557 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 163 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:41,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 683 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:15:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2025-02-06 03:15:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 726. [2025-02-06 03:15:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 624 states have (on average 1.1923076923076923) internal successors, (744), 635 states have internal predecessors, (744), 72 states have call successors, (72), 29 states have call predecessors, (72), 29 states have return successors, (72), 61 states have call predecessors, (72), 72 states have call successors, (72) [2025-02-06 03:15:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 888 transitions. [2025-02-06 03:15:41,634 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 888 transitions. Word has length 103 [2025-02-06 03:15:41,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:41,635 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 888 transitions. [2025-02-06 03:15:41,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 888 transitions. [2025-02-06 03:15:41,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 03:15:41,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:41,637 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:41,647 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:15:41,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:15:41,841 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:41,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:41,842 INFO L85 PathProgramCache]: Analyzing trace with hash 363732621, now seen corresponding path program 1 times [2025-02-06 03:15:41,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:41,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44533988] [2025-02-06 03:15:41,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:41,842 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:15:41,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:41,845 INFO L229 MonitoredProcess]: Starting monitored process 24 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:15:41,846 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 (24)] Waiting until timeout for monitored process [2025-02-06 03:15:41,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 03:15:42,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 03:15:42,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:42,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:42,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:15:42,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:42,131 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 61 treesize of output 54 [2025-02-06 03:15:42,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:15:42,717 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 78 treesize of output 54 [2025-02-06 03:15:42,719 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 43 treesize of output 19 [2025-02-06 03:15:42,757 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 03:15:42,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:15:42,757 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:15:42,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44533988] [2025-02-06 03:15:42,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44533988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:15:42,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:15:42,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:15:42,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889881993] [2025-02-06 03:15:42,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:15:42,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:15:42,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:15:42,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:15:42,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:15:42,759 INFO L87 Difference]: Start difference. First operand 726 states and 888 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:44,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:15:44,030 INFO L93 Difference]: Finished difference Result 1561 states and 1891 transitions. [2025-02-06 03:15:44,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:15:44,031 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-02-06 03:15:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:15:44,034 INFO L225 Difference]: With dead ends: 1561 [2025-02-06 03:15:44,034 INFO L226 Difference]: Without dead ends: 851 [2025-02-06 03:15:44,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:15:44,036 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 107 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:15:44,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 575 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 03:15:44,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-02-06 03:15:44,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 767. [2025-02-06 03:15:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 654 states have (on average 1.172782874617737) internal successors, (767), 666 states have internal predecessors, (767), 79 states have call successors, (79), 33 states have call predecessors, (79), 33 states have return successors, (79), 67 states have call predecessors, (79), 79 states have call successors, (79) [2025-02-06 03:15:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 925 transitions. [2025-02-06 03:15:44,125 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 925 transitions. Word has length 103 [2025-02-06 03:15:44,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:15:44,126 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 925 transitions. [2025-02-06 03:15:44,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-02-06 03:15:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 925 transitions. [2025-02-06 03:15:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-06 03:15:44,127 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:15:44,127 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:44,138 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 (24)] Ended with exit code 0 [2025-02-06 03:15:44,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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:15:44,331 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:15:44,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:15:44,331 INFO L85 PathProgramCache]: Analyzing trace with hash 49952797, now seen corresponding path program 1 times [2025-02-06 03:15:44,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:15:44,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773342621] [2025-02-06 03:15:44,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:15:44,332 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:15:44,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:15:44,335 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:15:44,336 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:15:44,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 03:15:44,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 03:15:44,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:15:44,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:15:44,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 03:15:44,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:15:44,548 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