./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.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-82.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 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:20:51,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:20:51,472 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:20:51,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:20:51,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:20:51,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:20:51,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:20:51,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:20:51,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:20:51,502 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:20:51,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:20:51,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:20:51,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:20:51,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:20:51,504 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:20:51,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:20:51,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:20:51,504 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:20:51,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:20:51,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:20:51,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:20:51,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:20:51,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:20:51,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:20:51,505 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:20:51,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:20:51,505 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:20:51,505 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:20:51,505 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:20:51,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:20:51,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:20:51,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:20:51,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:20:51,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:20:51,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:20:51,506 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:20:51,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:20:51,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:20:51,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:20:51,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:20:51,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:20:51,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:20:51,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:20:51,507 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 -> 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a [2025-02-06 03:20:51,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:20:51,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:20:51,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:20:51,753 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:20:51,753 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:20:51,755 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-82.i [2025-02-06 03:20:53,007 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a47fc243/eca691e40ebd43c6adc8b924edfb6f40/FLAG412f49df7 [2025-02-06 03:20:53,266 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:20:53,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i [2025-02-06 03:20:53,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a47fc243/eca691e40ebd43c6adc8b924edfb6f40/FLAG412f49df7 [2025-02-06 03:20:53,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1a47fc243/eca691e40ebd43c6adc8b924edfb6f40 [2025-02-06 03:20:53,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:20:53,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:20:53,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:20:53,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:20:53,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:20:53,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:20:53" (1/1) ... [2025-02-06 03:20:53,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf098e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:20:53, skipping insertion in model container [2025-02-06 03:20:53,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:20:53" (1/1) ... [2025-02-06 03:20:53,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:20:53,506 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-82.i[916,929] [2025-02-06 03:20:53,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:20:53,610 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:20:53,624 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-82.i[916,929] [2025-02-06 03:20:53,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:20:53,686 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:20:53,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:20:53 WrapperNode [2025-02-06 03:20:53,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:20:53,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:20:53,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:20:53,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:20:53,693 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:20:53" (1/1) ... [2025-02-06 03:20:53,701 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:20:53" (1/1) ... [2025-02-06 03:20:53,730 INFO L138 Inliner]: procedures = 29, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 511 [2025-02-06 03:20:53,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:20:53,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:20:53,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:20:53,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:20:53,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:20:53" (1/1) ... [2025-02-06 03:20:53,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:20:53" (1/1) ... [2025-02-06 03:20:53,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:20:53" (1/1) ... [2025-02-06 03:20:53,755 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 10, 6, 41, 74]. 56 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 2, 3, 8]. The 17 writes are split as follows [0, 1, 2, 3, 11]. [2025-02-06 03:20:53,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:20:53" (1/1) ... [2025-02-06 03:20:53,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:20:53" (1/1) ... [2025-02-06 03:20:53,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:20:53" (1/1) ... [2025-02-06 03:20:53,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:20:53" (1/1) ... [2025-02-06 03:20:53,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:20:53" (1/1) ... [2025-02-06 03:20:53,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:20:53" (1/1) ... [2025-02-06 03:20:53,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:20:53,778 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:20:53,778 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:20:53,778 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:20:53,779 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:20:53" (1/1) ... [2025-02-06 03:20:53,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:20:53,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:20:53,803 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:20:53,808 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:20:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:20:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:20:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:20:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:20:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:20:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:20:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:20:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:20:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:20:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:20:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:20:53,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:20:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:20:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:20:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:20:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:20:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:20:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:20:53,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:20:53,924 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:20:53,926 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:20:54,331 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~mem82#1;havoc property_#t~ite89#1;havoc property_#t~mem88#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~bitwise91#1;havoc property_#t~ite103#1;havoc property_#t~mem96#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~short104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite130#1;havoc property_#t~mem110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite114#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem115#1;havoc property_#t~ite127#1;havoc property_#t~mem121#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~short140#1; [2025-02-06 03:20:54,387 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-02-06 03:20:54,388 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:20:54,406 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:20:54,407 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:20:54,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:20:54 BoogieIcfgContainer [2025-02-06 03:20:54,407 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:20:54,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:20:54,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:20:54,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:20:54,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:20:53" (1/3) ... [2025-02-06 03:20:54,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f22bdad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:20:54, skipping insertion in model container [2025-02-06 03:20:54,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:20:53" (2/3) ... [2025-02-06 03:20:54,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f22bdad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:20:54, skipping insertion in model container [2025-02-06 03:20:54,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:20:54" (3/3) ... [2025-02-06 03:20:54,416 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-82.i [2025-02-06 03:20:54,429 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:20:54,431 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-82.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:20:54,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:20:54,473 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;@5b5ebea7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:20:54,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:20:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:20:54,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:20:54,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:54,485 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:54,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:54,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:54,489 INFO L85 PathProgramCache]: Analyzing trace with hash -192753194, now seen corresponding path program 1 times [2025-02-06 03:20:54,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:20:54,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700576969] [2025-02-06 03:20:54,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:54,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:20:54,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:20:54,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:20:54,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:54,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 03:20:54,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:20:54,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700576969] [2025-02-06 03:20:54,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700576969] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:20:54,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178704919] [2025-02-06 03:20:54,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:54,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:20:54,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:20:54,716 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:20:54,719 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:20:54,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:20:54,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:20:54,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:54,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:54,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:20:54,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 03:20:54,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:54,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178704919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:54,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:20:54,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:20:54,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761422464] [2025-02-06 03:20:54,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:54,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:20:54,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:20:54,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:20:54,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:20:54,975 INFO L87 Difference]: Start difference. First operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:20:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:55,001 INFO L93 Difference]: Finished difference Result 222 states and 341 transitions. [2025-02-06 03:20:55,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:20:55,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2025-02-06 03:20:55,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:55,013 INFO L225 Difference]: With dead ends: 222 [2025-02-06 03:20:55,013 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 03:20:55,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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:20:55,020 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:55,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:20:55,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 03:20:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-02-06 03:20:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:20:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2025-02-06 03:20:55,062 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 121 [2025-02-06 03:20:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:55,062 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2025-02-06 03:20:55,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:20:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2025-02-06 03:20:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:20:55,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:55,066 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:55,072 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:20:55,266 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:20:55,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:55,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:55,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1984213193, now seen corresponding path program 1 times [2025-02-06 03:20:55,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:20:55,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893593977] [2025-02-06 03:20:55,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:55,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:20:55,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:20:55,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:20:55,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:55,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:20:55,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:20:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893593977] [2025-02-06 03:20:55,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893593977] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:20:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114576067] [2025-02-06 03:20:55,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:55,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:20:55,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:20:55,787 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:20:55,792 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:20:55,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:20:55,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:20:55,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:55,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:55,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:20:55,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:56,028 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:20:56,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:56,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114576067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:56,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:20:56,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:20:56,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102950511] [2025-02-06 03:20:56,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:56,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:20:56,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:20:56,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:20:56,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:20:56,031 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:20:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:56,078 INFO L93 Difference]: Finished difference Result 222 states and 315 transitions. [2025-02-06 03:20:56,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:20:56,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-02-06 03:20:56,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:56,081 INFO L225 Difference]: With dead ends: 222 [2025-02-06 03:20:56,081 INFO L226 Difference]: Without dead ends: 114 [2025-02-06 03:20:56,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:20:56,084 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:56,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:20:56,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-06 03:20:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-02-06 03:20:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:20:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2025-02-06 03:20:56,097 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 121 [2025-02-06 03:20:56,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:56,098 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2025-02-06 03:20:56,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:20:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2025-02-06 03:20:56,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:20:56,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:56,099 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:56,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:20:56,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:20:56,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:56,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:56,302 INFO L85 PathProgramCache]: Analyzing trace with hash 176758730, now seen corresponding path program 1 times [2025-02-06 03:20:56,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:20:56,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39463273] [2025-02-06 03:20:56,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:56,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:20:56,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:20:56,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:20:56,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:56,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:20:56,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:20:56,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39463273] [2025-02-06 03:20:56,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39463273] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:20:56,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967173982] [2025-02-06 03:20:56,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:56,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:20:56,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:20:56,567 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:20:56,571 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:20:56,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:20:56,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:20:56,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:56,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:56,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:20:56,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:20:56,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:56,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967173982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:56,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:20:56,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:20:56,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925440388] [2025-02-06 03:20:56,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:56,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:20:56,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:20:56,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:20:56,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:20:56,763 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:20:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:56,794 INFO L93 Difference]: Finished difference Result 226 states and 319 transitions. [2025-02-06 03:20:56,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:20:56,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-02-06 03:20:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:56,799 INFO L225 Difference]: With dead ends: 226 [2025-02-06 03:20:56,800 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 03:20:56,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:20:56,801 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:56,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 446 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:20:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 03:20:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-02-06 03:20:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:20:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2025-02-06 03:20:56,816 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 121 [2025-02-06 03:20:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:56,820 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2025-02-06 03:20:56,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:20:56,820 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2025-02-06 03:20:56,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:20:56,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:56,821 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:56,835 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:20:57,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:20:57,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:57,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:57,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1064262411, now seen corresponding path program 1 times [2025-02-06 03:20:57,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:20:57,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629940672] [2025-02-06 03:20:57,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:57,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:20:57,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:20:57,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:20:57,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:57,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:20:57,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:20:57,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629940672] [2025-02-06 03:20:57,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629940672] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:20:57,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022076163] [2025-02-06 03:20:57,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:57,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:20:57,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:20:57,231 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:20:57,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:20:57,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:20:57,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:20:57,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:57,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:57,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:20:57,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:20:57,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:57,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022076163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:57,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:20:57,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:20:57,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122628502] [2025-02-06 03:20:57,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:57,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:20:57,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:20:57,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:20:57,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:20:57,441 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:20:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:57,468 INFO L93 Difference]: Finished difference Result 230 states and 323 transitions. [2025-02-06 03:20:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:20:57,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-02-06 03:20:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:57,470 INFO L225 Difference]: With dead ends: 230 [2025-02-06 03:20:57,471 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 03:20:57,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:20:57,471 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:57,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:20:57,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 03:20:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-02-06 03:20:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 101 states have internal predecessors, (135), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:20:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 163 transitions. [2025-02-06 03:20:57,483 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 163 transitions. Word has length 121 [2025-02-06 03:20:57,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:57,484 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 163 transitions. [2025-02-06 03:20:57,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:20:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 163 transitions. [2025-02-06 03:20:57,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:20:57,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:57,487 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:57,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 03:20:57,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:20:57,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:57,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1065185932, now seen corresponding path program 1 times [2025-02-06 03:20:57,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:20:57,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342032404] [2025-02-06 03:20:57,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:57,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:20:57,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:20:57,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:20:57,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:57,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:20:57,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:20:57,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342032404] [2025-02-06 03:20:57,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342032404] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:20:57,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11527933] [2025-02-06 03:20:57,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:57,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:20:57,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:20:57,837 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:20:57,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 03:20:57,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:20:58,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:20:58,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:58,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:58,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:20:58,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:20:58,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:58,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11527933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:58,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:20:58,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:20:58,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050638272] [2025-02-06 03:20:58,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:58,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:20:58,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:20:58,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:20:58,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:20:58,057 INFO L87 Difference]: Start difference. First operand 117 states and 163 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:20:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:58,086 INFO L93 Difference]: Finished difference Result 233 states and 326 transitions. [2025-02-06 03:20:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:20:58,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-02-06 03:20:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:58,087 INFO L225 Difference]: With dead ends: 233 [2025-02-06 03:20:58,088 INFO L226 Difference]: Without dead ends: 119 [2025-02-06 03:20:58,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:20:58,089 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:58,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:20:58,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-06 03:20:58,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-06 03:20:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3300970873786409) internal successors, (137), 103 states have internal predecessors, (137), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:20:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2025-02-06 03:20:58,097 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 121 [2025-02-06 03:20:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:58,097 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2025-02-06 03:20:58,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:20:58,097 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2025-02-06 03:20:58,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:20:58,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:58,098 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:58,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 03:20:58,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:20:58,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:58,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:58,303 INFO L85 PathProgramCache]: Analyzing trace with hash 556476518, now seen corresponding path program 1 times [2025-02-06 03:20:58,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:20:58,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498974485] [2025-02-06 03:20:58,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:58,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:20:58,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:20:58,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:20:58,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:58,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 03:20:58,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:20:58,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498974485] [2025-02-06 03:20:58,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498974485] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:20:58,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703510152] [2025-02-06 03:20:58,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:58,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:20:58,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:20:58,431 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:20:58,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 03:20:58,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:20:58,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:20:58,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:58,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:58,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:20:58,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:20:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:20:58,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:20:58,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703510152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:58,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:20:58,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-02-06 03:20:58,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390788080] [2025-02-06 03:20:58,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:58,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:20:58,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:20:58,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:20:58,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:20:58,612 INFO L87 Difference]: Start difference. First operand 119 states and 165 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:20:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:58,644 INFO L93 Difference]: Finished difference Result 238 states and 331 transitions. [2025-02-06 03:20:58,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:20:58,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:20:58,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:58,646 INFO L225 Difference]: With dead ends: 238 [2025-02-06 03:20:58,646 INFO L226 Difference]: Without dead ends: 122 [2025-02-06 03:20:58,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:20:58,646 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:58,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:20:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-06 03:20:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-02-06 03:20:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 104 states have (on average 1.3269230769230769) internal successors, (138), 104 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:20:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 166 transitions. [2025-02-06 03:20:58,651 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 166 transitions. Word has length 123 [2025-02-06 03:20:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:58,651 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 166 transitions. [2025-02-06 03:20:58,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:20:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 166 transitions. [2025-02-06 03:20:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:20:58,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:58,654 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:58,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 03:20:58,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-06 03:20:58,855 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:58,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:58,855 INFO L85 PathProgramCache]: Analyzing trace with hash -177795032, now seen corresponding path program 1 times [2025-02-06 03:20:58,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:20:58,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397006727] [2025-02-06 03:20:58,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:58,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:20:58,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:20:58,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:20:58,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:58,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:20:59,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:20:59,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397006727] [2025-02-06 03:20:59,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397006727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:59,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:20:59,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:20:59,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288803445] [2025-02-06 03:20:59,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:59,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:20:59,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:20:59,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:20:59,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:20:59,224 INFO L87 Difference]: Start difference. First operand 120 states and 166 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:20:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:59,288 INFO L93 Difference]: Finished difference Result 290 states and 400 transitions. [2025-02-06 03:20:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:20:59,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2025-02-06 03:20:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:59,290 INFO L225 Difference]: With dead ends: 290 [2025-02-06 03:20:59,290 INFO L226 Difference]: Without dead ends: 173 [2025-02-06 03:20:59,290 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:20:59,291 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 63 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:59,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 843 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:20:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-06 03:20:59,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 130. [2025-02-06 03:20:59,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 114 states have (on average 1.3421052631578947) internal successors, (153), 114 states have internal predecessors, (153), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:20:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 181 transitions. [2025-02-06 03:20:59,296 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 181 transitions. Word has length 125 [2025-02-06 03:20:59,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:59,296 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 181 transitions. [2025-02-06 03:20:59,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:20:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 181 transitions. [2025-02-06 03:20:59,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 03:20:59,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:59,300 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:59,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:20:59,301 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:59,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:59,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1606096595, now seen corresponding path program 1 times [2025-02-06 03:20:59,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:20:59,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160004763] [2025-02-06 03:20:59,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:59,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:20:59,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:20:59,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:20:59,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:59,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:20:59,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:20:59,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160004763] [2025-02-06 03:20:59,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160004763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:59,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:20:59,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:20:59,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307917088] [2025-02-06 03:20:59,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:59,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:20:59,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:20:59,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:20:59,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:20:59,617 INFO L87 Difference]: Start difference. First operand 130 states and 181 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:20:59,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:59,751 INFO L93 Difference]: Finished difference Result 295 states and 407 transitions. [2025-02-06 03:20:59,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:20:59,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 126 [2025-02-06 03:20:59,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:59,753 INFO L225 Difference]: With dead ends: 295 [2025-02-06 03:20:59,753 INFO L226 Difference]: Without dead ends: 168 [2025-02-06 03:20:59,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:20:59,754 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 67 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:59,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 860 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:20:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-06 03:20:59,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 125. [2025-02-06 03:20:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 109 states have (on average 1.3302752293577982) internal successors, (145), 109 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:20:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2025-02-06 03:20:59,763 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 126 [2025-02-06 03:20:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:59,763 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2025-02-06 03:20:59,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:20:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2025-02-06 03:20:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 03:20:59,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:59,765 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:59,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:20:59,765 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:59,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:59,765 INFO L85 PathProgramCache]: Analyzing trace with hash -351603880, now seen corresponding path program 1 times [2025-02-06 03:20:59,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:20:59,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647011590] [2025-02-06 03:20:59,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:59,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:20:59,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:20:59,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:20:59,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:20:59,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:20:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:20:59,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:20:59,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647011590] [2025-02-06 03:20:59,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647011590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:20:59,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:20:59,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:20:59,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112616205] [2025-02-06 03:20:59,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:20:59,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:20:59,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:20:59,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:20:59,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:20:59,874 INFO L87 Difference]: Start difference. First operand 125 states and 173 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:20:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:20:59,955 INFO L93 Difference]: Finished difference Result 321 states and 445 transitions. [2025-02-06 03:20:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:20:59,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126 [2025-02-06 03:20:59,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:20:59,958 INFO L225 Difference]: With dead ends: 321 [2025-02-06 03:20:59,958 INFO L226 Difference]: Without dead ends: 199 [2025-02-06 03:20:59,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:20:59,958 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 70 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:20:59,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 689 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:20:59,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-06 03:20:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 165. [2025-02-06 03:20:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 149 states have (on average 1.3624161073825503) internal successors, (203), 149 states have internal predecessors, (203), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:20:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 231 transitions. [2025-02-06 03:20:59,965 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 231 transitions. Word has length 126 [2025-02-06 03:20:59,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:20:59,966 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 231 transitions. [2025-02-06 03:20:59,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:20:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 231 transitions. [2025-02-06 03:20:59,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 03:20:59,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:20:59,968 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:59,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:20:59,968 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:20:59,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:20:59,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1614232148, now seen corresponding path program 1 times [2025-02-06 03:20:59,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:20:59,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524244882] [2025-02-06 03:20:59,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:20:59,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:20:59,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:21:00,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:21:00,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:00,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:21:01,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:01,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524244882] [2025-02-06 03:21:01,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524244882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:01,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:01,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:21:01,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522829561] [2025-02-06 03:21:01,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:01,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:21:01,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:01,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:21:01,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:21:01,749 INFO L87 Difference]: Start difference. First operand 165 states and 231 transitions. Second operand has 15 states, 12 states have (on average 4.916666666666667) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:21:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:02,581 INFO L93 Difference]: Finished difference Result 544 states and 757 transitions. [2025-02-06 03:21:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 03:21:02,583 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.916666666666667) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 126 [2025-02-06 03:21:02,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:02,585 INFO L225 Difference]: With dead ends: 544 [2025-02-06 03:21:02,585 INFO L226 Difference]: Without dead ends: 382 [2025-02-06 03:21:02,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:21:02,589 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 261 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:02,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 2086 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:21:02,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-02-06 03:21:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 318. [2025-02-06 03:21:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 296 states have internal predecessors, (405), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 03:21:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 445 transitions. [2025-02-06 03:21:02,607 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 445 transitions. Word has length 126 [2025-02-06 03:21:02,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:02,608 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 445 transitions. [2025-02-06 03:21:02,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.916666666666667) internal successors, (59), 15 states have internal predecessors, (59), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 03:21:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 445 transitions. [2025-02-06 03:21:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 03:21:02,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:02,612 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:02,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:21:02,612 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:02,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash 991774300, now seen corresponding path program 1 times [2025-02-06 03:21:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:02,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787347870] [2025-02-06 03:21:02,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:02,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:02,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:21:02,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:21:02,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:02,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:21:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787347870] [2025-02-06 03:21:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787347870] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:02,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:02,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:02,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113375405] [2025-02-06 03:21:02,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:02,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:02,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:02,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:02,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:02,783 INFO L87 Difference]: Start difference. First operand 318 states and 445 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:02,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:02,997 INFO L93 Difference]: Finished difference Result 843 states and 1171 transitions. [2025-02-06 03:21:02,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:21:02,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126 [2025-02-06 03:21:02,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:03,000 INFO L225 Difference]: With dead ends: 843 [2025-02-06 03:21:03,000 INFO L226 Difference]: Without dead ends: 528 [2025-02-06 03:21:03,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:21:03,003 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 193 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:03,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 638 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:21:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-06 03:21:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 481. [2025-02-06 03:21:03,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 436 states have (on average 1.348623853211009) internal successors, (588), 438 states have internal predecessors, (588), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:21:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 668 transitions. [2025-02-06 03:21:03,032 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 668 transitions. Word has length 126 [2025-02-06 03:21:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:03,032 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 668 transitions. [2025-02-06 03:21:03,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 668 transitions. [2025-02-06 03:21:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:21:03,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:03,033 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:03,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:21:03,033 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:03,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:03,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1976603198, now seen corresponding path program 1 times [2025-02-06 03:21:03,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:03,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560415312] [2025-02-06 03:21:03,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:03,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:03,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:21:03,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:21:03,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:03,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:21:03,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:21:03,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:21:03,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:21:03,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:03,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:21:03,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:21:03,220 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:21:03,220 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:21:03,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:21:03,223 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:21:03,277 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:21:03,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:21:03 BoogieIcfgContainer [2025-02-06 03:21:03,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:21:03,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:21:03,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:21:03,280 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:21:03,281 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:20:54" (3/4) ... [2025-02-06 03:21:03,282 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:21:03,283 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:21:03,283 INFO L158 Benchmark]: Toolchain (without parser) took 9977.15ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 110.6MB in the beginning and 283.6MB in the end (delta: -173.0MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. [2025-02-06 03:21:03,283 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:21:03,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.07ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 94.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:21:03,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.86ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 89.5MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:21:03,283 INFO L158 Benchmark]: Boogie Preprocessor took 46.99ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 84.7MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:21:03,284 INFO L158 Benchmark]: IcfgBuilder took 629.27ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 47.6MB in the end (delta: 37.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 03:21:03,284 INFO L158 Benchmark]: TraceAbstraction took 8869.69ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 47.6MB in the beginning and 283.7MB in the end (delta: -236.2MB). Peak memory consumption was 61.9kB. Max. memory is 16.1GB. [2025-02-06 03:21:03,284 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 385.9MB. Free memory was 283.7MB in the beginning and 283.6MB in the end (delta: 120.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:21:03,285 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.27ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.07ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 94.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.86ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 89.5MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.99ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 84.7MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 629.27ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 47.6MB in the end (delta: 37.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8869.69ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 47.6MB in the beginning and 283.7MB in the end (delta: -236.2MB). Peak memory consumption was 61.9kB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 385.9MB. Free memory was 283.7MB in the beginning and 283.6MB in the end (delta: 120.1kB). Peak memory consumption was 8.4MB. 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 someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] double double_Array_0[2] = { 3.75, 255.5 }; [L25-L27] double double_Array_0[2] = { 3.75, 255.5 }; [L25-L27] double double_Array_0[2] = { 3.75, 255.5 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L28-L30] float float_Array_0[3] = { 255.5, 63.5, 128.75 }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L31-L33] unsigned char unsigned_char_Array_0[2][2][2] = { {{2, 0}, {128, 10}}, {{25, 5}, {16, 32}} }; [L34] unsigned char last_1_unsigned_char_Array_0_0__0__0_ = 2; [L35] unsigned char last_1_unsigned_char_Array_0_0__0__1_ = 0; [L36] unsigned char last_1_unsigned_char_Array_0_1__1__1_ = 32; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L92] EXPR unsigned_char_Array_0[0][0][0] [L92] last_1_unsigned_char_Array_0_0__0__0_ = unsigned_char_Array_0[0][0][0] [L93] EXPR unsigned_char_Array_0[0][0][1] [L93] last_1_unsigned_char_Array_0_0__0__1_ = unsigned_char_Array_0[0][0][1] [L94] EXPR unsigned_char_Array_0[1][1][1] [L94] last_1_unsigned_char_Array_0_1__1__1_ = unsigned_char_Array_0[1][1][1] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L68] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L69] 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L69] 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L70] 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L70] 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L71] float_Array_0[0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L72] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L73] float_Array_0[1] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L74] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L75] unsigned_char_Array_0[1][0][0] = __VERIFIER_nondet_uchar() [L76] EXPR unsigned_char_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L76] RET assume_abort_if_not(unsigned_char_Array_0[1][0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L77] EXPR unsigned_char_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L77] RET assume_abort_if_not(unsigned_char_Array_0[1][0][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L78] unsigned_char_Array_0[0][1][0] = __VERIFIER_nondet_uchar() [L79] EXPR unsigned_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L79] RET assume_abort_if_not(unsigned_char_Array_0[0][1][0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L80] EXPR unsigned_char_Array_0[0][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[0][1][0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L81] unsigned_char_Array_0[1][1][0] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[1][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[1][1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L83] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[1][1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[1][1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L84] unsigned_char_Array_0[1][0][1] = __VERIFIER_nondet_uchar() [L85] EXPR unsigned_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[1][0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L86] EXPR unsigned_char_Array_0[1][0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1][0][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1][0][1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L87] unsigned_char_Array_0[0][1][1] = __VERIFIER_nondet_uchar() [L88] EXPR unsigned_char_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[0][1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L89] EXPR unsigned_char_Array_0[0][1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0][1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, 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}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0][1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L105] RET updateVariables() [L106] CALL step() [L40] EXPR last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_ VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L40] signed long int stepLocal_0 = last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_; [L41] COND FALSE !((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= stepLocal_0) [L44] EXPR unsigned_char_Array_0[0][1][0] [L44] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L44] EXPR ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]) [L44] EXPR unsigned_char_Array_0[1][1][0] [L44] EXPR ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L44] unsigned_char_Array_0[1][1][1] = (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))) [L46] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L46] COND FALSE !(! BOOL_unsigned_char_Array_0[0]) [L51] EXPR float_Array_0[0] [L51] double_Array_0[0] = float_Array_0[0] [L52] EXPR unsigned_char_Array_0[1][0][0] [L52] unsigned_char_Array_0[0][0][1] = unsigned_char_Array_0[1][0][0] [L53] EXPR float_Array_0[1] [L53] double_Array_0[1] = float_Array_0[1] [L54] EXPR unsigned_char_Array_0[1][0][0] [L54] unsigned char stepLocal_1 = unsigned_char_Array_0[1][0][0]; [L55] EXPR unsigned_char_Array_0[1][1][1] [L55] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L55] COND FALSE !((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= stepLocal_1) [L64] EXPR unsigned_char_Array_0[1][0][0] [L64] unsigned_char_Array_0[0][0][0] = unsigned_char_Array_0[1][0][0] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1 [L97] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_ VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))) [L97] EXPR unsigned_char_Array_0[1][1][1] [L97] EXPR unsigned_char_Array_0[0][1][0] [L97] EXPR unsigned_char_Array_0[1][1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]) [L97] EXPR unsigned_char_Array_0[1][1][0] [L97] EXPR ((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) [L97] EXPR unsigned_char_Array_0[1][1][1] [L97] EXPR unsigned_char_Array_0[1][1][0] [L97] EXPR unsigned_char_Array_0[1][0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])) [L97] EXPR unsigned_char_Array_0[0][0][0] [L97] EXPR unsigned_char_Array_0[1][0][0] [L97] EXPR ((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0])) [L97] EXPR double_Array_0[0] [L97] EXPR float_Array_0[0] [L97] EXPR ((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR (((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0])) [L97] EXPR unsigned_char_Array_0[0][0][1] [L97] EXPR unsigned_char_Array_0[1][0][0] [L97] EXPR (((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97] EXPR ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1])) [L97] EXPR double_Array_0[1] [L97] EXPR float_Array_0[1] [L97] EXPR ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L97-L98] return ((((((! BOOL_unsigned_char_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0] ? (float_Array_0[2] == ((float) ((((float_Array_0[1]) > (float_Array_0[0])) ? (float_Array_0[1]) : (float_Array_0[0]))))) : 1) : 1) && (((last_1_unsigned_char_Array_0_1__1__1_ / -2) >= (last_1_unsigned_char_Array_0_0__0__1_ | last_1_unsigned_char_Array_0_0__0__0_)) ? (unsigned_char_Array_0[1][1][1] == ((unsigned char) ((((unsigned_char_Array_0[1][0][0]) < 0 ) ? -(unsigned_char_Array_0[1][0][0]) : (unsigned_char_Array_0[1][0][0]))))) : (unsigned_char_Array_0[1][1][1] == ((unsigned char) (unsigned_char_Array_0[0][1][0] - ((((unsigned_char_Array_0[1][1][0]) < 0 ) ? -(unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][1][0])))))))) && (((unsigned_char_Array_0[1][1][1] + unsigned_char_Array_0[1][1][0]) >= unsigned_char_Array_0[1][0][0]) ? ((((((float_Array_0[0]) > ((float_Array_0[2] * float_Array_0[1]))) ? (float_Array_0[0]) : ((float_Array_0[2] * float_Array_0[1])))) <= float_Array_0[2]) ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][1][0]) > (unsigned_char_Array_0[1][0][1])) ? (unsigned_char_Array_0[1][1][0]) : (unsigned_char_Array_0[1][0][1]))))) : (BOOL_unsigned_char_Array_0[0] ? (unsigned_char_Array_0[0][0][0] == ((unsigned char) (unsigned_char_Array_0[1][1][0] + unsigned_char_Array_0[0][1][1]))) : 1)) : (unsigned_char_Array_0[0][0][0] == ((unsigned char) unsigned_char_Array_0[1][0][0])))) && (double_Array_0[0] == ((double) float_Array_0[0]))) && (unsigned_char_Array_0[0][0][1] == ((unsigned char) unsigned_char_Array_0[1][0][0]))) && (double_Array_0[1] == ((double) float_Array_0[1])) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_char_Array_0_0__0__0_=2, last_1_unsigned_char_Array_0_0__0__1_=0, last_1_unsigned_char_Array_0_1__1__1_=32, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 662 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 657 mSDsluCounter, 7651 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5873 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1376 IncrementalHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 1778 mSDtfsCounter, 1376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 825 GetRequests, 752 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=481occurred in iteration=11, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 236 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2213 NumberOfCodeBlocks, 2213 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2068 ConstructedInterpolants, 0 QuantifiedInterpolants, 3352 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2551 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 5967/6188 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:21:03,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-82.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 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:21:05,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:21:05,521 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:21:05,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:21:05,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:21:05,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:21:05,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:21:05,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:21:05,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:21:05,557 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:21:05,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:21:05,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:21:05,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:21:05,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:21:05,558 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:21:05,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:21:05,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:21:05,559 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:21:05,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:21:05,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:21:05,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:21:05,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:21:05,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:21:05,560 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:21:05,560 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:21:05,560 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:21:05,560 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:21:05,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:21:05,560 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:21:05,560 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:21:05,560 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:21:05,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:21:05,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:21:05,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:21:05,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:21:05,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:21:05,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:21:05,561 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:21:05,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:21:05,562 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:21:05,562 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:21:05,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:21:05,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:21:05,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:21:05,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:21:05,562 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 -> 67160a6df79d1049c73d7b3dbc4aa323b185d65b8c91424febe1ccb6e4daf12a [2025-02-06 03:21:05,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:21:05,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:21:05,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:21:05,868 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:21:05,869 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:21:05,870 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-82.i [2025-02-06 03:21:07,241 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/086b34140/232f5e3050ab4a8f8e1d7498ec584e40/FLAG3e9341a2b [2025-02-06 03:21:07,488 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:21:07,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-82.i [2025-02-06 03:21:07,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/086b34140/232f5e3050ab4a8f8e1d7498ec584e40/FLAG3e9341a2b [2025-02-06 03:21:07,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/086b34140/232f5e3050ab4a8f8e1d7498ec584e40 [2025-02-06 03:21:07,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:21:07,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:21:07,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:21:07,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:21:07,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:21:07,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:21:07" (1/1) ... [2025-02-06 03:21:07,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57796d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:07, skipping insertion in model container [2025-02-06 03:21:07,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:21:07" (1/1) ... [2025-02-06 03:21:07,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:21:07,776 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-82.i[916,929] [2025-02-06 03:21:07,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:21:07,909 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:21:07,925 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-82.i[916,929] [2025-02-06 03:21:08,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:21:08,056 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:21:08,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08 WrapperNode [2025-02-06 03:21:08,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:21:08,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:21:08,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:21:08,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:21:08,072 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:21:08" (1/1) ... [2025-02-06 03:21:08,096 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:21:08" (1/1) ... [2025-02-06 03:21:08,165 INFO L138 Inliner]: procedures = 33, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 494 [2025-02-06 03:21:08,165 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:21:08,166 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:21:08,166 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:21:08,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:21:08,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,229 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 10, 6, 41, 74]. 56 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 2, 3, 8]. The 17 writes are split as follows [0, 1, 2, 3, 11]. [2025-02-06 03:21:08,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,270 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:21:08,292 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:21:08,292 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:21:08,292 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:21:08,295 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:21:08,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:21:08,320 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:21:08,323 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:21:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:21:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:21:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:21:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:21:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:21:08,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:21:08,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:21:08,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:21:08,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:21:08,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:21:08,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:21:08,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:21:08,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:21:08,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:21:08,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:21:08,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:21:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:21:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:21:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:21:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:21:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:21:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:21:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:21:08,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:21:08,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:21:08,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:21:08,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:21:08,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:21:08,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:21:08,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:21:08,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:21:08,490 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:21:08,492 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:21:10,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~mem80#1;havoc property_#t~ite89#1;havoc property_#t~mem81#1;havoc property_#t~ite88#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite101#1;havoc property_#t~mem94#1;havoc property_#t~mem90#1;havoc property_#t~ite93#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short102#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite128#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~ite125#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short129#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short132#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1; [2025-02-06 03:21:10,054 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-02-06 03:21:10,054 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:21:10,061 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:21:10,061 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:21:10,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:21:10 BoogieIcfgContainer [2025-02-06 03:21:10,061 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:21:10,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:21:10,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:21:10,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:21:10,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:21:07" (1/3) ... [2025-02-06 03:21:10,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a18b561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:21:10, skipping insertion in model container [2025-02-06 03:21:10,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (2/3) ... [2025-02-06 03:21:10,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a18b561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:21:10, skipping insertion in model container [2025-02-06 03:21:10,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:21:10" (3/3) ... [2025-02-06 03:21:10,068 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-82.i [2025-02-06 03:21:10,077 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:21:10,078 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-82.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:21:10,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:21:10,124 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;@7f32a11c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:21:10,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:21:10,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:21:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:21:10,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:10,132 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:10,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:10,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:10,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1738834489, now seen corresponding path program 1 times [2025-02-06 03:21:10,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:10,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967476800] [2025-02-06 03:21:10,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:10,143 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:21:10,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:10,144 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:21:10,146 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:21:10,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:21:10,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:21:10,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:10,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:10,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:21:10,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-02-06 03:21:10,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:10,425 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:10,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967476800] [2025-02-06 03:21:10,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967476800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:10,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:10,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:21:10,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053050846] [2025-02-06 03:21:10,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:10,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:21:10,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:10,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:21:10,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:21:10,459 INFO L87 Difference]: Start difference. First operand has 107 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:21:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:10,502 INFO L93 Difference]: Finished difference Result 208 states and 319 transitions. [2025-02-06 03:21:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:21:10,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-02-06 03:21:10,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:10,520 INFO L225 Difference]: With dead ends: 208 [2025-02-06 03:21:10,521 INFO L226 Difference]: Without dead ends: 104 [2025-02-06 03:21:10,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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:21:10,529 INFO L435 NwaCegarLoop]: 146 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, 146 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:21:10,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-06 03:21:10,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-06 03:21:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 03:21:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2025-02-06 03:21:10,611 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 119 [2025-02-06 03:21:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:10,611 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2025-02-06 03:21:10,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:21:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2025-02-06 03:21:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:21:10,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:10,619 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:10,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 03:21:10,820 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:21:10,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:10,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:10,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1304584634, now seen corresponding path program 1 times [2025-02-06 03:21:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:10,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385223622] [2025-02-06 03:21:10,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:10,825 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:21:10,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:10,829 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:21:10,832 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:21:10,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:21:11,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:21:11,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:11,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:11,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:21:11,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:11,167 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:21:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:21:11,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:11,379 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:11,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385223622] [2025-02-06 03:21:11,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385223622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:11,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:11,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:21:11,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213693133] [2025-02-06 03:21:11,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:11,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:21:11,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:11,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:21:11,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:21:11,381 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:11,821 INFO L93 Difference]: Finished difference Result 303 states and 429 transitions. [2025-02-06 03:21:11,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:21:11,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-02-06 03:21:11,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:11,825 INFO L225 Difference]: With dead ends: 303 [2025-02-06 03:21:11,825 INFO L226 Difference]: Without dead ends: 202 [2025-02-06 03:21:11,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:11,826 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 118 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:11,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 471 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:21:11,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-06 03:21:11,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 174. [2025-02-06 03:21:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 143 states have (on average 1.3356643356643356) internal successors, (191), 143 states have internal predecessors, (191), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:21:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 247 transitions. [2025-02-06 03:21:11,844 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 247 transitions. Word has length 119 [2025-02-06 03:21:11,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:11,845 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 247 transitions. [2025-02-06 03:21:11,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:11,845 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 247 transitions. [2025-02-06 03:21:11,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:21:11,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:11,846 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:11,855 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:21:12,049 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:21:12,049 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:12,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:12,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1023178946, now seen corresponding path program 1 times [2025-02-06 03:21:12,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:12,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805853841] [2025-02-06 03:21:12,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:12,051 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:21:12,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:12,053 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:21:12,055 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:21:12,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:21:12,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:21:12,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:12,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:12,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:21:12,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:21:12,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:12,248 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:12,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805853841] [2025-02-06 03:21:12,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805853841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:12,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:12,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:21:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775687964] [2025-02-06 03:21:12,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:12,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:21:12,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:12,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:21:12,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:21:12,250 INFO L87 Difference]: Start difference. First operand 174 states and 247 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:12,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:12,274 INFO L93 Difference]: Finished difference Result 279 states and 396 transitions. [2025-02-06 03:21:12,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:21:12,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-02-06 03:21:12,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:12,276 INFO L225 Difference]: With dead ends: 279 [2025-02-06 03:21:12,276 INFO L226 Difference]: Without dead ends: 178 [2025-02-06 03:21:12,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 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:21:12,277 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:12,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:12,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-06 03:21:12,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-02-06 03:21:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 147 states have internal predecessors, (195), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:21:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 251 transitions. [2025-02-06 03:21:12,288 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 251 transitions. Word has length 119 [2025-02-06 03:21:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:12,288 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 251 transitions. [2025-02-06 03:21:12,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 251 transitions. [2025-02-06 03:21:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 03:21:12,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:12,290 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:12,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 03:21:12,494 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:21:12,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:12,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:12,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1911516392, now seen corresponding path program 1 times [2025-02-06 03:21:12,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:12,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923216069] [2025-02-06 03:21:12,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:12,496 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:21:12,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:12,503 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:21:12,504 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:21:12,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 03:21:12,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 03:21:12,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:12,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:12,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:21:12,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:13,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-06 03:21:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-02-06 03:21:13,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:21:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:21:13,342 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:13,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923216069] [2025-02-06 03:21:13,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923216069] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:13,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:21:13,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-02-06 03:21:13,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299313925] [2025-02-06 03:21:13,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:13,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:21:13,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:13,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:21:13,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:21:13,343 INFO L87 Difference]: Start difference. First operand 178 states and 251 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:13,434 INFO L93 Difference]: Finished difference Result 345 states and 485 transitions. [2025-02-06 03:21:13,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:21:13,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-02-06 03:21:13,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:13,439 INFO L225 Difference]: With dead ends: 345 [2025-02-06 03:21:13,439 INFO L226 Difference]: Without dead ends: 235 [2025-02-06 03:21:13,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:21:13,440 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 58 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:13,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 606 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:13,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-06 03:21:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 198. [2025-02-06 03:21:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 167 states have (on average 1.347305389221557) internal successors, (225), 167 states have internal predecessors, (225), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:21:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 281 transitions. [2025-02-06 03:21:13,467 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 281 transitions. Word has length 121 [2025-02-06 03:21:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:13,468 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 281 transitions. [2025-02-06 03:21:13,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 281 transitions. [2025-02-06 03:21:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:21:13,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:13,469 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:13,476 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 (5)] Forceful destruction successful, exit code 0 [2025-02-06 03:21:13,674 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:21:13,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:13,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:13,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1527556301, now seen corresponding path program 1 times [2025-02-06 03:21:13,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:13,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833697463] [2025-02-06 03:21:13,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:13,678 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:21:13,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:13,679 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:21:13,681 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:21:13,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:21:13,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:21:13,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:13,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:13,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:21:13,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:21:13,928 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:13,928 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:13,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833697463] [2025-02-06 03:21:13,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833697463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:13,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:13,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:21:13,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645469590] [2025-02-06 03:21:13,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:13,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:21:13,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:13,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:21:13,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:21:13,930 INFO L87 Difference]: Start difference. First operand 198 states and 281 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:13,963 INFO L93 Difference]: Finished difference Result 317 states and 449 transitions. [2025-02-06 03:21:13,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:21:13,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-02-06 03:21:13,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:13,965 INFO L225 Difference]: With dead ends: 317 [2025-02-06 03:21:13,965 INFO L226 Difference]: Without dead ends: 204 [2025-02-06 03:21:13,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:21:13,966 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:13,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 557 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-02-06 03:21:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2025-02-06 03:21:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 169 states have (on average 1.3431952662721893) internal successors, (227), 169 states have internal predecessors, (227), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:21:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 283 transitions. [2025-02-06 03:21:13,975 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 283 transitions. Word has length 122 [2025-02-06 03:21:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:13,975 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 283 transitions. [2025-02-06 03:21:13,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:13,976 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 283 transitions. [2025-02-06 03:21:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:21:13,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:13,977 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:13,986 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 (6)] Forceful destruction successful, exit code 0 [2025-02-06 03:21:14,181 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:21:14,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:14,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:14,182 INFO L85 PathProgramCache]: Analyzing trace with hash 255495831, now seen corresponding path program 1 times [2025-02-06 03:21:14,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:14,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017734856] [2025-02-06 03:21:14,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:14,182 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:21:14,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:14,185 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:21:14,193 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:21:14,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:21:14,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:21:14,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:14,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:14,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:21:14,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:21:14,374 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:14,374 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:14,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017734856] [2025-02-06 03:21:14,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017734856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:14,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:14,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:21:14,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051088267] [2025-02-06 03:21:14,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:14,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:21:14,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:14,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:21:14,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:21:14,375 INFO L87 Difference]: Start difference. First operand 200 states and 283 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:14,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:14,452 INFO L93 Difference]: Finished difference Result 317 states and 448 transitions. [2025-02-06 03:21:14,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:21:14,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:21:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:14,454 INFO L225 Difference]: With dead ends: 317 [2025-02-06 03:21:14,454 INFO L226 Difference]: Without dead ends: 203 [2025-02-06 03:21:14,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 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:21:14,455 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:14,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 418 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-06 03:21:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2025-02-06 03:21:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 171 states have internal predecessors, (229), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:21:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 285 transitions. [2025-02-06 03:21:14,463 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 285 transitions. Word has length 123 [2025-02-06 03:21:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:14,463 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 285 transitions. [2025-02-06 03:21:14,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 285 transitions. [2025-02-06 03:21:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:21:14,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:14,464 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:14,471 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 (7)] Forceful destruction successful, exit code 0 [2025-02-06 03:21:14,665 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:21:14,665 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:14,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:14,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1551958632, now seen corresponding path program 1 times [2025-02-06 03:21:14,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:14,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769241188] [2025-02-06 03:21:14,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:14,666 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:21:14,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:14,668 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:21:14,670 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:21:14,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:21:14,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:21:14,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:14,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:14,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:21:14,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:21:14,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:14,882 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:14,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769241188] [2025-02-06 03:21:14,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769241188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:14,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:14,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:21:14,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587266519] [2025-02-06 03:21:14,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:14,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:21:14,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:14,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:21:14,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:21:14,884 INFO L87 Difference]: Start difference. First operand 202 states and 285 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:14,954 INFO L93 Difference]: Finished difference Result 321 states and 452 transitions. [2025-02-06 03:21:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:21:14,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:21:14,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:14,955 INFO L225 Difference]: With dead ends: 321 [2025-02-06 03:21:14,955 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 03:21:14,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:21:14,956 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:14,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 549 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 03:21:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2025-02-06 03:21:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 173 states have internal predecessors, (231), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:21:14,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 287 transitions. [2025-02-06 03:21:14,971 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 287 transitions. Word has length 123 [2025-02-06 03:21:14,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:14,971 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 287 transitions. [2025-02-06 03:21:14,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:14,971 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 287 transitions. [2025-02-06 03:21:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:21:14,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:14,972 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:14,979 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:21:15,176 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:21:15,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:15,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash -664454951, now seen corresponding path program 1 times [2025-02-06 03:21:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:15,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820886524] [2025-02-06 03:21:15,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:15,178 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:21:15,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:15,180 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:21:15,182 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:21:15,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:21:15,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:21:15,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:15,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:15,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:21:15,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:21:15,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:15,370 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:15,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820886524] [2025-02-06 03:21:15,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820886524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:15,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:15,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:15,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720004739] [2025-02-06 03:21:15,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:15,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:15,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:15,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:15,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:15,372 INFO L87 Difference]: Start difference. First operand 204 states and 287 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:15,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:15,480 INFO L93 Difference]: Finished difference Result 325 states and 456 transitions. [2025-02-06 03:21:15,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:21:15,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:21:15,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:15,481 INFO L225 Difference]: With dead ends: 325 [2025-02-06 03:21:15,481 INFO L226 Difference]: Without dead ends: 207 [2025-02-06 03:21:15,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 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:21:15,482 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:15,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 680 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-02-06 03:21:15,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2025-02-06 03:21:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 175 states have (on average 1.3314285714285714) internal successors, (233), 175 states have internal predecessors, (233), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 03:21:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 289 transitions. [2025-02-06 03:21:15,491 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 289 transitions. Word has length 123 [2025-02-06 03:21:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:15,491 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 289 transitions. [2025-02-06 03:21:15,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 289 transitions. [2025-02-06 03:21:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 03:21:15,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:15,493 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:15,499 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:21:15,693 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:21:15,693 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:15,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:15,694 INFO L85 PathProgramCache]: Analyzing trace with hash -663531430, now seen corresponding path program 1 times [2025-02-06 03:21:15,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:15,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077225953] [2025-02-06 03:21:15,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:15,695 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:21:15,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:15,696 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:21:15,698 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:21:15,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 03:21:15,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 03:21:15,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:15,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:15,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 03:21:15,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:15,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 03:21:16,059 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 41 treesize of output 19 [2025-02-06 03:21:16,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:16,238 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 47 treesize of output 43 [2025-02-06 03:21:16,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:16,455 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 57 treesize of output 56 [2025-02-06 03:21:16,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:16,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 76 treesize of output 72 [2025-02-06 03:21:17,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 95 [2025-02-06 03:21:17,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:17,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 126 treesize of output 119 [2025-02-06 03:21:18,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:18,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 163 treesize of output 75 [2025-02-06 03:21:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 260 proven. 30 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-06 03:21:18,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:21:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:21:18,998 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:18,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077225953] [2025-02-06 03:21:18,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077225953] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:18,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:21:18,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [23] total 31 [2025-02-06 03:21:18,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975355320] [2025-02-06 03:21:18,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:19,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:21:19,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:19,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:21:19,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:21:19,002 INFO L87 Difference]: Start difference. First operand 206 states and 289 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:21,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:21,331 INFO L93 Difference]: Finished difference Result 518 states and 716 transitions. [2025-02-06 03:21:21,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:21:21,331 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-02-06 03:21:21,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:21,333 INFO L225 Difference]: With dead ends: 518 [2025-02-06 03:21:21,333 INFO L226 Difference]: Without dead ends: 398 [2025-02-06 03:21:21,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=187, Invalid=1219, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 03:21:21,334 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 345 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:21,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1404 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 03:21:21,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-02-06 03:21:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 334. [2025-02-06 03:21:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 296 states have (on average 1.3412162162162162) internal successors, (397), 297 states have internal predecessors, (397), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:21:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 465 transitions. [2025-02-06 03:21:21,350 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 465 transitions. Word has length 123 [2025-02-06 03:21:21,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:21,350 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 465 transitions. [2025-02-06 03:21:21,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:21,351 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 465 transitions. [2025-02-06 03:21:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:21:21,352 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:21,352 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:21,360 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:21:21,557 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:21:21,557 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:21,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:21,558 INFO L85 PathProgramCache]: Analyzing trace with hash 598293496, now seen corresponding path program 1 times [2025-02-06 03:21:21,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:21,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020314065] [2025-02-06 03:21:21,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:21,558 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:21:21,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:21,560 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:21:21,562 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:21:21,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:21:21,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:21:21,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:21,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:21,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:21:21,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-02-06 03:21:21,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:21:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 03:21:22,013 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:22,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020314065] [2025-02-06 03:21:22,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020314065] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:22,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:21:22,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-02-06 03:21:22,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271675502] [2025-02-06 03:21:22,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:22,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:21:22,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:22,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:21:22,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:21:22,014 INFO L87 Difference]: Start difference. First operand 334 states and 465 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:22,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:22,068 INFO L93 Difference]: Finished difference Result 647 states and 885 transitions. [2025-02-06 03:21:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:21:22,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2025-02-06 03:21:22,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:22,071 INFO L225 Difference]: With dead ends: 647 [2025-02-06 03:21:22,071 INFO L226 Difference]: Without dead ends: 401 [2025-02-06 03:21:22,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 238 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:21:22,072 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 124 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:22,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 502 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:22,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-06 03:21:22,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 309. [2025-02-06 03:21:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 271 states have (on average 1.3173431734317342) internal successors, (357), 272 states have internal predecessors, (357), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:21:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 425 transitions. [2025-02-06 03:21:22,085 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 425 transitions. Word has length 124 [2025-02-06 03:21:22,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:22,086 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 425 transitions. [2025-02-06 03:21:22,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 03:21:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 425 transitions. [2025-02-06 03:21:22,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:21:22,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:22,087 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:22,093 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 (11)] Ended with exit code 0 [2025-02-06 03:21:22,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:21:22,288 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:22,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:22,289 INFO L85 PathProgramCache]: Analyzing trace with hash -474080696, now seen corresponding path program 1 times [2025-02-06 03:21:22,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:22,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871127014] [2025-02-06 03:21:22,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:22,289 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:21:22,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:22,291 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:21:22,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-02-06 03:21:22,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:21:22,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:21:22,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:22,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:22,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 03:21:22,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:23,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2025-02-06 03:21:26,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:26,918 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 182 treesize of output 98 [2025-02-06 03:21:26,929 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 197 treesize of output 107 [2025-02-06 03:21:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-02-06 03:21:27,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:27,252 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:27,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871127014] [2025-02-06 03:21:27,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871127014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:27,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:27,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:21:27,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274506878] [2025-02-06 03:21:27,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:27,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:21:27,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:27,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:21:27,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:21:27,253 INFO L87 Difference]: Start difference. First operand 309 states and 425 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:21:30,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:21:38,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 03:21:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:38,734 INFO L93 Difference]: Finished difference Result 609 states and 828 transitions. [2025-02-06 03:21:38,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:21:38,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2025-02-06 03:21:38,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:38,740 INFO L225 Difference]: With dead ends: 609 [2025-02-06 03:21:38,740 INFO L226 Difference]: Without dead ends: 607 [2025-02-06 03:21:38,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:21:38,741 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 302 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:38,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 908 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2025-02-06 03:21:38,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-02-06 03:21:38,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2025-02-06 03:21:38,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 529 states have (on average 1.3081285444234405) internal successors, (692), 533 states have internal predecessors, (692), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 61 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 03:21:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 822 transitions. [2025-02-06 03:21:38,766 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 822 transitions. Word has length 125 [2025-02-06 03:21:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:38,767 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 822 transitions. [2025-02-06 03:21:38,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:21:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 822 transitions. [2025-02-06 03:21:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:21:38,770 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:38,770 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:38,781 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 (12)] Forceful destruction successful, exit code 0 [2025-02-06 03:21:38,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:21:38,974 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:38,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:38,975 INFO L85 PathProgramCache]: Analyzing trace with hash -473157175, now seen corresponding path program 1 times [2025-02-06 03:21:38,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:38,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507339609] [2025-02-06 03:21:38,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:38,975 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:21:38,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:38,978 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:21:38,979 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:21:39,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:21:39,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:21:39,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:39,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:39,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 03:21:39,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:39,224 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:21:39,232 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:21:39,236 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:21:39,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 03:21:39,310 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 30 treesize of output 14 [2025-02-06 03:21:39,372 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 30 treesize of output 14 [2025-02-06 03:21:39,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:39,388 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 32 treesize of output 34 [2025-02-06 03:21:39,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:39,416 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 47 treesize of output 46 [2025-02-06 03:21:39,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:39,677 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 88 treesize of output 36 [2025-02-06 03:21:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-02-06 03:21:39,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:39,710 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:39,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507339609] [2025-02-06 03:21:39,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507339609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:39,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:39,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:21:39,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322382617] [2025-02-06 03:21:39,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:39,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:21:39,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:39,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:21:39,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:21:39,711 INFO L87 Difference]: Start difference. First operand 603 states and 822 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:21:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:41,001 INFO L93 Difference]: Finished difference Result 1323 states and 1774 transitions. [2025-02-06 03:21:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:21:41,002 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2025-02-06 03:21:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:41,008 INFO L225 Difference]: With dead ends: 1323 [2025-02-06 03:21:41,008 INFO L226 Difference]: Without dead ends: 881 [2025-02-06 03:21:41,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:21:41,010 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 265 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:41,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 640 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 03:21:41,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-02-06 03:21:41,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 677. [2025-02-06 03:21:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 599 states have (on average 1.2854757929883138) internal successors, (770), 603 states have internal predecessors, (770), 65 states have call successors, (65), 12 states have call predecessors, (65), 12 states have return successors, (65), 61 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 03:21:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 900 transitions. [2025-02-06 03:21:41,046 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 900 transitions. Word has length 125 [2025-02-06 03:21:41,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:41,046 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 900 transitions. [2025-02-06 03:21:41,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:21:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 900 transitions. [2025-02-06 03:21:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:21:41,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:41,049 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:41,058 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:21:41,253 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:21:41,253 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:41,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:41,253 INFO L85 PathProgramCache]: Analyzing trace with hash 414346506, now seen corresponding path program 1 times [2025-02-06 03:21:41,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:41,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832177638] [2025-02-06 03:21:41,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:41,254 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:21:41,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:41,256 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:21:41,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-02-06 03:21:41,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:21:41,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:21:41,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:41,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:41,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 03:21:41,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:41,550 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:21:41,756 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 68 treesize of output 32 [2025-02-06 03:21:42,694 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 35 treesize of output 29 [2025-02-06 03:21:46,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:46,155 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 166 treesize of output 90 [2025-02-06 03:21:46,159 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 167 treesize of output 107 [2025-02-06 03:21:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-02-06 03:21:46,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:46,464 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:46,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832177638] [2025-02-06 03:21:46,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832177638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:46,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:46,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:21:46,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179995848] [2025-02-06 03:21:46,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:46,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:21:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:46,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:21:46,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:21:46,466 INFO L87 Difference]: Start difference. First operand 677 states and 900 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:21:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:53,349 INFO L93 Difference]: Finished difference Result 1862 states and 2455 transitions. [2025-02-06 03:21:53,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:21:53,354 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2025-02-06 03:21:53,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:53,360 INFO L225 Difference]: With dead ends: 1862 [2025-02-06 03:21:53,360 INFO L226 Difference]: Without dead ends: 1346 [2025-02-06 03:21:53,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:21:53,362 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 306 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:53,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 751 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-02-06 03:21:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2025-02-06 03:21:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1340. [2025-02-06 03:21:53,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1183 states have (on average 1.2772612003381234) internal successors, (1511), 1195 states have internal predecessors, (1511), 128 states have call successors, (128), 28 states have call predecessors, (128), 28 states have return successors, (128), 116 states have call predecessors, (128), 128 states have call successors, (128) [2025-02-06 03:21:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1767 transitions. [2025-02-06 03:21:53,437 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1767 transitions. Word has length 125 [2025-02-06 03:21:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:53,438 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 1767 transitions. [2025-02-06 03:21:53,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:21:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1767 transitions. [2025-02-06 03:21:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:21:53,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:53,439 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:53,448 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:21:53,644 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:21:53,644 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:53,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:53,644 INFO L85 PathProgramCache]: Analyzing trace with hash 41439753, now seen corresponding path program 1 times [2025-02-06 03:21:53,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:53,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231625188] [2025-02-06 03:21:53,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:53,645 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:21:53,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:53,649 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:21:53,650 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:21:53,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:21:53,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:21:53,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:53,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:53,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:21:53,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-02-06 03:21:53,837 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:53,837 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:53,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231625188] [2025-02-06 03:21:53,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231625188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:53,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:53,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:21:53,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887451023] [2025-02-06 03:21:53,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:53,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:21:53,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:53,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:21:53,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:21:53,838 INFO L87 Difference]: Start difference. First operand 1340 states and 1767 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:21:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:53,915 INFO L93 Difference]: Finished difference Result 2508 states and 3296 transitions. [2025-02-06 03:21:53,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:21:53,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2025-02-06 03:21:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:53,920 INFO L225 Difference]: With dead ends: 2508 [2025-02-06 03:21:53,920 INFO L226 Difference]: Without dead ends: 1340 [2025-02-06 03:21:53,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 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:21:53,922 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 409 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:21:53,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 409 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:53,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2025-02-06 03:21:53,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2025-02-06 03:21:53,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1183 states have (on average 1.272189349112426) internal successors, (1505), 1195 states have internal predecessors, (1505), 128 states have call successors, (128), 28 states have call predecessors, (128), 28 states have return successors, (128), 116 states have call predecessors, (128), 128 states have call successors, (128) [2025-02-06 03:21:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1761 transitions. [2025-02-06 03:21:53,967 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1761 transitions. Word has length 125 [2025-02-06 03:21:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:53,967 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 1761 transitions. [2025-02-06 03:21:53,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:21:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1761 transitions. [2025-02-06 03:21:53,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 03:21:53,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:53,968 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:53,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-02-06 03:21:54,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:21:54,169 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:54,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:54,169 INFO L85 PathProgramCache]: Analyzing trace with hash -572236183, now seen corresponding path program 1 times [2025-02-06 03:21:54,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:54,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925078407] [2025-02-06 03:21:54,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:54,170 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:21:54,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:54,172 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:21:54,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-02-06 03:21:54,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 03:21:54,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 03:21:54,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:54,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:54,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:21:54,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-02-06 03:21:54,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:54,371 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:21:54,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925078407] [2025-02-06 03:21:54,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925078407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:54,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:54,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:21:54,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918896483] [2025-02-06 03:21:54,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:54,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:21:54,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:21:54,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:21:54,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:21:54,372 INFO L87 Difference]: Start difference. First operand 1340 states and 1761 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:21:54,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:54,437 INFO L93 Difference]: Finished difference Result 2517 states and 3299 transitions. [2025-02-06 03:21:54,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:21:54,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2025-02-06 03:21:54,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:54,442 INFO L225 Difference]: With dead ends: 2517 [2025-02-06 03:21:54,442 INFO L226 Difference]: Without dead ends: 1340 [2025-02-06 03:21:54,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 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:21:54,444 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 409 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:21:54,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 409 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2025-02-06 03:21:54,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2025-02-06 03:21:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1183 states have (on average 1.267962806424345) internal successors, (1500), 1195 states have internal predecessors, (1500), 128 states have call successors, (128), 28 states have call predecessors, (128), 28 states have return successors, (128), 116 states have call predecessors, (128), 128 states have call successors, (128) [2025-02-06 03:21:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1756 transitions. [2025-02-06 03:21:54,498 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1756 transitions. Word has length 125 [2025-02-06 03:21:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:54,498 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 1756 transitions. [2025-02-06 03:21:54,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 03:21:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1756 transitions. [2025-02-06 03:21:54,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 03:21:54,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:54,500 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:54,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2025-02-06 03:21:54,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:21:54,701 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:54,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1870909172, now seen corresponding path program 1 times [2025-02-06 03:21:54,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:21:54,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122899390] [2025-02-06 03:21:54,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:54,702 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:21:54,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:21:54,704 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:21:54,705 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:21:54,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:21:55,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:21:55,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:55,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:55,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 03:21:55,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:55,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:21:55,419 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 66 treesize of output 30 [2025-02-06 03:21:56,313 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 39 [2025-02-06 03:21:59,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:59,440 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 176 treesize of output 94 [2025-02-06 03:21:59,447 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 165 treesize of output 105 [2025-02-06 03:21:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 107 proven. 33 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-06 03:21:59,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:22:03,372 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:22:03,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122899390] [2025-02-06 03:22:03,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122899390] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:22:03,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [155536167] [2025-02-06 03:22:03,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:03,373 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:22:03,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:22:03,376 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:22:03,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2025-02-06 03:22:03,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 03:22:04,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 03:22:04,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:04,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:04,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 03:22:04,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:04,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:22:05,998 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 62 treesize of output 30 [2025-02-06 03:22:07,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-02-06 03:22:14,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:14,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 90 [2025-02-06 03:22:14,716 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 165 treesize of output 105 [2025-02-06 03:22:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 107 proven. 33 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-02-06 03:22:14,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:22:18,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [155536167] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:22:18,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:22:18,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2025-02-06 03:22:18,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853287119] [2025-02-06 03:22:18,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:22:18,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 03:22:18,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:22:18,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 03:22:18,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=436, Unknown=1, NotChecked=0, Total=552 [2025-02-06 03:22:18,248 INFO L87 Difference]: Start difference. First operand 1340 states and 1756 transitions. Second operand has 22 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 6 states have call successors, (28), 6 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28)