./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.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-p_file-26.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 4eafc4bfcba9d31705115bfcf6cea5cccc44f2a222fea4448f4711e0f4e7a043 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:37:30,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:37:30,974 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:37:30,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:37:30,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:37:31,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:37:31,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:37:31,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:37:31,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:37:31,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:37:31,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:37:31,003 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:37:31,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:37:31,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:37:31,003 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:37:31,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:37:31,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:37:31,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:37:31,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:37:31,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:37:31,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:37:31,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:37:31,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:37:31,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:37:31,004 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:37:31,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:37:31,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:37:31,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:37:31,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:37:31,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:37:31,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:37:31,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:37:31,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:37:31,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:37:31,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:37:31,005 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:37:31,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:37:31,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:37:31,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:37:31,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:37:31,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:37:31,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:37:31,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:37:31,006 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 -> 4eafc4bfcba9d31705115bfcf6cea5cccc44f2a222fea4448f4711e0f4e7a043 [2025-02-06 03:37:31,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:37:31,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:37:31,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:37:31,239 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:37:31,239 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:37:31,241 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-p_file-26.i [2025-02-06 03:37:32,506 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c40572065/f224b370d5a246ec9e867d9c7ca42bfd/FLAGd48ef5cd2 [2025-02-06 03:37:32,734 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:37:32,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i [2025-02-06 03:37:32,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c40572065/f224b370d5a246ec9e867d9c7ca42bfd/FLAGd48ef5cd2 [2025-02-06 03:37:32,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c40572065/f224b370d5a246ec9e867d9c7ca42bfd [2025-02-06 03:37:32,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:37:32,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:37:32,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:37:32,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:37:32,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:37:32,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:37:32" (1/1) ... [2025-02-06 03:37:32,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d42316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:32, skipping insertion in model container [2025-02-06 03:37:32,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:37:32" (1/1) ... [2025-02-06 03:37:32,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:37:32,894 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-p_file-26.i[916,929] [2025-02-06 03:37:32,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:37:32,934 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:37:32,951 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-p_file-26.i[916,929] [2025-02-06 03:37:33,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:37:33,036 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:37:33,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:33 WrapperNode [2025-02-06 03:37:33,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:37:33,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:37:33,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:37:33,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:37:33,042 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:37:33" (1/1) ... [2025-02-06 03:37:33,049 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:37:33" (1/1) ... [2025-02-06 03:37:33,078 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 497 [2025-02-06 03:37:33,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:37:33,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:37:33,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:37:33,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:37:33,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:33" (1/1) ... [2025-02-06 03:37:33,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:33" (1/1) ... [2025-02-06 03:37:33,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:33" (1/1) ... [2025-02-06 03:37:33,121 INFO L175 MemorySlicer]: Split 129 memory accesses to 11 slices as follows [2, 13, 6, 3, 10, 8, 64, 6, 3, 7, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 11 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-02-06 03:37:33,123 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:33" (1/1) ... [2025-02-06 03:37:33,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:33" (1/1) ... [2025-02-06 03:37:33,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:33" (1/1) ... [2025-02-06 03:37:33,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:33" (1/1) ... [2025-02-06 03:37:33,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:33" (1/1) ... [2025-02-06 03:37:33,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:33" (1/1) ... [2025-02-06 03:37:33,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:37:33,156 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:37:33,156 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:37:33,156 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:37:33,161 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:33" (1/1) ... [2025-02-06 03:37:33,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:37:33,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:37:33,191 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:37:33,199 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:37:33,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:37:33,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:37:33,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:37:33,218 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:37:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:37:33,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:37:33,375 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:37:33,377 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:37:33,855 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite114#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~mem113#1;havoc property_#t~mem93#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite112#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-02-06 03:37:33,891 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-02-06 03:37:33,891 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:37:33,903 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:37:33,903 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:37:33,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:37:33 BoogieIcfgContainer [2025-02-06 03:37:33,904 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:37:33,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:37:33,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:37:33,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:37:33,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:37:32" (1/3) ... [2025-02-06 03:37:33,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a9c73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:37:33, skipping insertion in model container [2025-02-06 03:37:33,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:33" (2/3) ... [2025-02-06 03:37:33,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a9c73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:37:33, skipping insertion in model container [2025-02-06 03:37:33,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:37:33" (3/3) ... [2025-02-06 03:37:33,912 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-26.i [2025-02-06 03:37:33,923 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:37:33,926 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-26.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:37:33,974 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:37:33,986 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;@21e65f89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:37:33,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:37:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:37:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:37:33,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:33,998 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:33,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:34,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:34,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2095636372, now seen corresponding path program 1 times [2025-02-06 03:37:34,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:34,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822652397] [2025-02-06 03:37:34,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:34,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:34,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:37:34,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:37:34,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:34,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-06 03:37:34,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:34,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822652397] [2025-02-06 03:37:34,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822652397] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:37:34,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328833934] [2025-02-06 03:37:34,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:34,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:37:34,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:37:34,220 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:37:34,222 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:37:34,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:37:34,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:37:34,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:34,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:34,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:37:34,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:37:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-06 03:37:34,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:37:34,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328833934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:34,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:37:34,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:37:34,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072012131] [2025-02-06 03:37:34,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:34,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:37:34,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:34,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:37:34,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:37:34,505 INFO L87 Difference]: Start difference. First operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 03:37:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:34,540 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2025-02-06 03:37:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:37:34,544 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-02-06 03:37:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:34,549 INFO L225 Difference]: With dead ends: 178 [2025-02-06 03:37:34,549 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 03:37:34,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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:37:34,553 INFO L435 NwaCegarLoop]: 127 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, 127 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:37:34,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:37:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 03:37:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 03:37:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:37:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2025-02-06 03:37:34,598 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2025-02-06 03:37:34,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:34,599 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2025-02-06 03:37:34,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 03:37:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2025-02-06 03:37:34,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:37:34,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:34,604 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:34,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 03:37:34,804 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:37:34,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:34,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1027674547, now seen corresponding path program 1 times [2025-02-06 03:37:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:34,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161196258] [2025-02-06 03:37:34,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:34,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:34,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:37:34,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:37:34,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:34,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:37:35,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:35,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161196258] [2025-02-06 03:37:35,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161196258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:35,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:37:35,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:37:35,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909676786] [2025-02-06 03:37:35,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:35,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:37:35,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:35,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:37:35,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:37:35,032 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:37:35,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:35,066 INFO L93 Difference]: Finished difference Result 178 states and 255 transitions. [2025-02-06 03:37:35,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:37:35,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-02-06 03:37:35,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:35,068 INFO L225 Difference]: With dead ends: 178 [2025-02-06 03:37:35,068 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 03:37:35,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:37:35,069 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:35,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 363 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:37:35,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 03:37:35,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-02-06 03:37:35,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:37:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2025-02-06 03:37:35,075 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 89 [2025-02-06 03:37:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:35,076 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2025-02-06 03:37:35,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:37:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2025-02-06 03:37:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:37:35,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:35,078 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:35,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:37:35,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:35,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:35,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1026751026, now seen corresponding path program 1 times [2025-02-06 03:37:35,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:35,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435495604] [2025-02-06 03:37:35,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:35,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:35,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:37:35,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:37:35,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:35,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:37:35,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:35,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435495604] [2025-02-06 03:37:35,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435495604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:35,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:37:35,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:37:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440235376] [2025-02-06 03:37:35,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:35,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:37:35,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:35,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:37:35,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:37:35,394 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:37:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:35,456 INFO L93 Difference]: Finished difference Result 179 states and 255 transitions. [2025-02-06 03:37:35,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:37:35,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-02-06 03:37:35,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:35,457 INFO L225 Difference]: With dead ends: 179 [2025-02-06 03:37:35,457 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 03:37:35,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:37:35,458 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:35,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:37:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 03:37:35,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-06 03:37:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:37:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2025-02-06 03:37:35,463 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 89 [2025-02-06 03:37:35,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:35,463 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2025-02-06 03:37:35,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:37:35,463 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2025-02-06 03:37:35,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:37:35,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:35,464 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:35,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:37:35,465 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:35,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:35,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1532309651, now seen corresponding path program 1 times [2025-02-06 03:37:35,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:35,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856358717] [2025-02-06 03:37:35,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:35,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:35,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:37:35,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:37:35,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:35,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:37:35,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:37:35,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856358717] [2025-02-06 03:37:35,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856358717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:35,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:37:35,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:37:35,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86657981] [2025-02-06 03:37:35,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:35,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:37:35,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:37:35,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:37:35,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:37:35,778 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:37:35,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:35,849 INFO L93 Difference]: Finished difference Result 179 states and 253 transitions. [2025-02-06 03:37:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:37:35,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-02-06 03:37:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:35,851 INFO L225 Difference]: With dead ends: 179 [2025-02-06 03:37:35,851 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 03:37:35,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:37:35,854 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:35,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:37:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 03:37:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-06 03:37:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:37:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 127 transitions. [2025-02-06 03:37:35,864 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 127 transitions. Word has length 89 [2025-02-06 03:37:35,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:35,864 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 127 transitions. [2025-02-06 03:37:35,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:37:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 127 transitions. [2025-02-06 03:37:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:37:35,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:35,865 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:35,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:37:35,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:35,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:35,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1941133876, now seen corresponding path program 1 times [2025-02-06 03:37:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:37:35,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500551554] [2025-02-06 03:37:35,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:35,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:37:35,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:37:35,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:37:35,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:35,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 03:37:35,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1556853652] [2025-02-06 03:37:35,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:35,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:37:35,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:37:35,985 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:37:35,989 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:37:36,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:37:36,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:37:36,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:36,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:37:36,296 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:37:36,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:37:36,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:37:36,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:36,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:37:36,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:37:36,492 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:37:36,492 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:37:36,502 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:37:36,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:37:36,697 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 03:37:36,773 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:37:36,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:37:36 BoogieIcfgContainer [2025-02-06 03:37:36,775 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:37:36,775 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:37:36,775 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:37:36,776 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:37:36,776 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:37:33" (3/4) ... [2025-02-06 03:37:36,777 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:37:36,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:37:36,778 INFO L158 Benchmark]: Toolchain (without parser) took 4023.81ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 74.2MB in the end (delta: 48.8MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2025-02-06 03:37:36,778 INFO L158 Benchmark]: CDTParser took 1.22ms. Allocated memory is still 209.7MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:37:36,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.76ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 108.5MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:37:36,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.07ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 104.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:37:36,779 INFO L158 Benchmark]: Boogie Preprocessor took 76.40ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 100.4MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:37:36,779 INFO L158 Benchmark]: IcfgBuilder took 747.63ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 62.6MB in the end (delta: 37.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 03:37:36,779 INFO L158 Benchmark]: TraceAbstraction took 2868.95ms. Allocated memory is still 167.8MB. Free memory was 62.1MB in the beginning and 75.6MB in the end (delta: -13.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:37:36,779 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 167.8MB. Free memory was 75.6MB in the beginning and 74.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:37:36,780 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.22ms. Allocated memory is still 209.7MB. Free memory is still 129.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.76ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 108.5MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.07ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 104.8MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 76.40ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 100.4MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 747.63ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 62.6MB in the end (delta: 37.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2868.95ms. Allocated memory is still 167.8MB. Free memory was 62.1MB in the beginning and 75.6MB in the end (delta: -13.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 167.8MB. Free memory was 75.6MB in the beginning and 74.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of someBinaryArithmeticFLOAToperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L22] signed short int var_1_1 = -1; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_4 = 1; [L24] signed short int var_1_4 = 1; [L25] signed short int* var_1_4_Pointer = &(var_1_4); [L26] float var_1_12 = 1.125; [L26] float var_1_12 = 1.125; [L27] float* var_1_12_Pointer = &(var_1_12); [L28] float var_1_13 = 199.5; [L28] float var_1_13 = 199.5; [L29] float* var_1_13_Pointer = &(var_1_13); [L30] float var_1_14 = 100000000000000.3; [L30] float var_1_14 = 100000000000000.3; [L31] float* var_1_14_Pointer = &(var_1_14); [L32] unsigned char var_1_15 = 64; [L32] unsigned char var_1_15 = 64; [L33] unsigned char* var_1_15_Pointer = &(var_1_15); [L34] unsigned char var_1_16 = 2; [L34] unsigned char var_1_16 = 2; [L35] unsigned char* var_1_16_Pointer = &(var_1_16); [L36] unsigned long int var_1_17 = 50; [L36] unsigned long int var_1_17 = 50; [L37] unsigned long int* var_1_17_Pointer = &(var_1_17); [L38] signed long int var_1_19 = -32; [L38] signed long int var_1_19 = -32; [L39] signed long int* var_1_19_Pointer = &(var_1_19); [L40] float var_1_20 = 8.75; [L40] float var_1_20 = 8.75; [L41] float* var_1_20_Pointer = &(var_1_20); [L42] unsigned char last_1_var_1_15 = 64; VAL [isInitial=0, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L78] EXPR \read(var_1_15) [L78] last_1_var_1_15 = var_1_15 [L88] RET updateLastVariables() [L89] CALL updateVariables() [L62] var_1_4 = __VERIFIER_nondet_short() [L63] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L63] CALL assume_abort_if_not(var_1_4 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L63] RET assume_abort_if_not(var_1_4 >= -32767) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L64] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L64] CALL assume_abort_if_not(var_1_4 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L64] RET assume_abort_if_not(var_1_4 <= 32766) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L65] var_1_13 = __VERIFIER_nondet_float() [L66] EXPR \read(var_1_13) [L66] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L66] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F [L66] EXPR \read(var_1_13) [L66] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L66] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L66] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L66] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L66] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L67] var_1_14 = __VERIFIER_nondet_float() [L68] EXPR \read(var_1_14) [L68] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L68] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F [L68] EXPR \read(var_1_14) [L68] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L68] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L68] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L68] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L68] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L69] var_1_16 = __VERIFIER_nondet_uchar() [L70] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L70] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L70] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L71] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L71] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L71] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L72] var_1_19 = __VERIFIER_nondet_long() [L73] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L73] CALL assume_abort_if_not(var_1_19 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L73] RET assume_abort_if_not(var_1_19 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L74] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L74] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L74] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L75] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L75] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L75] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L89] RET updateVariables() [L90] CALL step() [L46] EXPR \read(*var_1_13_Pointer) [L46] EXPR \read(*var_1_14_Pointer) [L46] (*(var_1_12_Pointer)) = ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) [L47] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L47] COND TRUE (- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4)))) [L48] EXPR \read(*var_1_16_Pointer) [L48] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L50] EXPR \read(*var_1_13_Pointer) [L50] (*(var_1_20_Pointer)) = (*(var_1_13_Pointer)) [L51] EXPR \read(*var_1_20_Pointer) [L51] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L51] COND TRUE (*(var_1_20_Pointer)) > (*(var_1_20_Pointer)) [L52] EXPR \read(*var_1_15_Pointer) [L52] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L52] EXPR (((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) [L52] EXPR \read(*var_1_15_Pointer) [L52] EXPR (((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L52] (*(var_1_1_Pointer)) = (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) [L56] EXPR \read(*var_1_15_Pointer) [L56] EXPR \read(*var_1_15_Pointer) [L56] EXPR \read(*var_1_1_Pointer) [L56] signed long int stepLocal_0 = (*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer))); [L57] EXPR \read(*var_1_15_Pointer) [L57] EXPR \read(*var_1_1_Pointer) [L57] EXPR \read(*var_1_19_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L57] COND FALSE !(stepLocal_0 != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) [L90] RET step() [L91] CALL, EXPR property() [L81] EXPR \read(*var_1_20_Pointer) [L81] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))))))) [L81] EXPR \read(*var_1_1_Pointer) [L81] EXPR \read(*var_1_15_Pointer) [L81] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR (((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) [L81] EXPR \read(*var_1_15_Pointer) [L81] EXPR (((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))))))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR (((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR (((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))))) [L81] EXPR \read(*var_1_12_Pointer) [L81] EXPR \read(*var_1_13_Pointer) [L81] EXPR \read(*var_1_14_Pointer) [L81] EXPR (((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR (((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1)) && ((((*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer)))) != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer))))) ? (10u) : (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer)))))) + (*(var_1_15_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR (((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1)) && ((((*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer)))) != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer))))) ? (10u) : (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer)))))) + (*(var_1_15_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1)) && ((((*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer)))) != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer))))) ? (10u) : (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer)))))) + (*(var_1_15_Pointer))))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_13_Pointer)))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1)) && ((((*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer)))) != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer))))) ? (10u) : (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer)))))) + (*(var_1_15_Pointer))))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_13_Pointer)))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81-L82] return ((((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1)) && ((((*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer)))) != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer))))) ? (10u) : (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer)))))) + (*(var_1_15_Pointer))))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_13_Pointer)))) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 1020 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 522 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 498 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 623 NumberOfCodeBlocks, 623 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 440 ConstructedInterpolants, 0 QuantifiedInterpolants, 468 SizeOfPredicates, 0 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 704/720 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:37:36,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.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 4eafc4bfcba9d31705115bfcf6cea5cccc44f2a222fea4448f4711e0f4e7a043 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:37:38,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:37:38,982 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:37:38,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:37:38,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:37:39,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:37:39,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:37:39,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:37:39,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:37:39,008 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:37:39,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:37:39,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:37:39,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:37:39,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:37:39,009 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:37:39,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:37:39,010 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:37:39,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:37:39,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:37:39,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:37:39,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:37:39,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:37:39,012 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:37:39,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:37:39,012 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:37:39,012 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:37:39,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:37:39,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:37:39,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:37:39,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:37:39,013 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 -> 4eafc4bfcba9d31705115bfcf6cea5cccc44f2a222fea4448f4711e0f4e7a043 [2025-02-06 03:37:39,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:37:39,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:37:39,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:37:39,314 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:37:39,314 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:37:39,316 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-p_file-26.i [2025-02-06 03:37:40,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e07602e7f/42a83fc1b2b54437b29a3b8a71bc411e/FLAGe8416e75c [2025-02-06 03:37:40,754 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:37:40,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i [2025-02-06 03:37:40,764 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e07602e7f/42a83fc1b2b54437b29a3b8a71bc411e/FLAGe8416e75c [2025-02-06 03:37:41,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e07602e7f/42a83fc1b2b54437b29a3b8a71bc411e [2025-02-06 03:37:41,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:37:41,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:37:41,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:37:41,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:37:41,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:37:41,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:37:41" (1/1) ... [2025-02-06 03:37:41,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@efc5768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:41, skipping insertion in model container [2025-02-06 03:37:41,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:37:41" (1/1) ... [2025-02-06 03:37:41,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:37:41,160 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-p_file-26.i[916,929] [2025-02-06 03:37:41,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:37:41,203 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:37:41,210 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-p_file-26.i[916,929] [2025-02-06 03:37:41,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:37:41,248 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:37:41,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:41 WrapperNode [2025-02-06 03:37:41,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:37:41,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:37:41,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:37:41,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:37:41,254 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:37:41" (1/1) ... [2025-02-06 03:37:41,265 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:37:41" (1/1) ... [2025-02-06 03:37:41,290 INFO L138 Inliner]: procedures = 36, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2025-02-06 03:37:41,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:37:41,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:37:41,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:37:41,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:37:41,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:41" (1/1) ... [2025-02-06 03:37:41,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:41" (1/1) ... [2025-02-06 03:37:41,301 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:41" (1/1) ... [2025-02-06 03:37:41,315 INFO L175 MemorySlicer]: Split 129 memory accesses to 11 slices as follows [2, 13, 6, 3, 10, 8, 64, 6, 3, 7, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 11 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-02-06 03:37:41,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:41" (1/1) ... [2025-02-06 03:37:41,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:41" (1/1) ... [2025-02-06 03:37:41,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:41" (1/1) ... [2025-02-06 03:37:41,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:41" (1/1) ... [2025-02-06 03:37:41,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:41" (1/1) ... [2025-02-06 03:37:41,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:41" (1/1) ... [2025-02-06 03:37:41,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:37:41,339 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:37:41,339 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:37:41,340 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:37:41,340 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:41" (1/1) ... [2025-02-06 03:37:41,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:37:41,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:37:41,366 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:37:41,368 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:37:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:37:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:37:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:37:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:37:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:37:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:37:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:37:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-06 03:37:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-02-06 03:37:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-02-06 03:37:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-02-06 03:37:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-02-06 03:37:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:37:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:37:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:37:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:37:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:37:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:37:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-02-06 03:37:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-02-06 03:37:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-02-06 03:37:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-02-06 03:37:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-02-06 03:37:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:37:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:37:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-02-06 03:37:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:37:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-02-06 03:37:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:37:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:37:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:37:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:37:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:37:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-02-06 03:37:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-02-06 03:37:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-02-06 03:37:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-02-06 03:37:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-02-06 03:37:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-02-06 03:37:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:37:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:37:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:37:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:37:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:37:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:37:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:37:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:37:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:37:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:37:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-06 03:37:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-02-06 03:37:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-02-06 03:37:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-02-06 03:37:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-02-06 03:37:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:37:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:37:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:37:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:37:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:37:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:37:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-02-06 03:37:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-02-06 03:37:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-02-06 03:37:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-02-06 03:37:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-02-06 03:37:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:37:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:37:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:37:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:37:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:37:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:37:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-02-06 03:37:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-02-06 03:37:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-02-06 03:37:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-02-06 03:37:41,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-02-06 03:37:41,609 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:37:41,610 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:37:42,519 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L81: havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite114#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~mem113#1;havoc property_#t~mem93#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite112#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-02-06 03:37:42,545 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-02-06 03:37:42,545 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:37:42,553 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:37:42,553 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:37:42,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:37:42 BoogieIcfgContainer [2025-02-06 03:37:42,555 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:37:42,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:37:42,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:37:42,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:37:42,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:37:41" (1/3) ... [2025-02-06 03:37:42,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34439858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:37:42, skipping insertion in model container [2025-02-06 03:37:42,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:37:41" (2/3) ... [2025-02-06 03:37:42,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34439858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:37:42, skipping insertion in model container [2025-02-06 03:37:42,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:37:42" (3/3) ... [2025-02-06 03:37:42,567 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-26.i [2025-02-06 03:37:42,579 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:37:42,580 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-26.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:37:42,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:37:42,648 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;@3321526a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:37:42,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:37:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:37:42,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:37:42,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:42,664 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:42,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:42,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:42,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2095636372, now seen corresponding path program 1 times [2025-02-06 03:37:42,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:37:42,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273918772] [2025-02-06 03:37:42,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:42,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:37:42,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:37:42,684 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:37:42,689 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:37:42,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:37:43,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:37:43,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:43,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:43,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:37:43,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:37:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-06 03:37:43,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:37:43,092 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:37:43,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273918772] [2025-02-06 03:37:43,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273918772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:43,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:37:43,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:37:43,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836916941] [2025-02-06 03:37:43,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:43,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:37:43,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:37:43,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:37:43,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:37:43,111 INFO L87 Difference]: Start difference. First operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 03:37:43,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:43,128 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2025-02-06 03:37:43,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:37:43,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-02-06 03:37:43,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:43,133 INFO L225 Difference]: With dead ends: 178 [2025-02-06 03:37:43,133 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 03:37:43,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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:37:43,136 INFO L435 NwaCegarLoop]: 127 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, 127 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:37:43,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:37:43,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 03:37:43,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 03:37:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:37:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2025-02-06 03:37:43,189 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2025-02-06 03:37:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:43,189 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2025-02-06 03:37:43,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 03:37:43,190 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2025-02-06 03:37:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:37:43,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:43,192 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:43,203 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:37:43,392 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:37:43,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:43,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:43,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1027674547, now seen corresponding path program 1 times [2025-02-06 03:37:43,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:37:43,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730093553] [2025-02-06 03:37:43,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:43,395 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:37:43,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:37:43,397 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:37:43,399 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:37:43,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:37:43,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:37:43,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:43,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:43,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:37:43,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:37:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:37:43,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:37:43,787 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:37:43,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730093553] [2025-02-06 03:37:43,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730093553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:43,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:37:43,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:37:43,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291405567] [2025-02-06 03:37:43,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:43,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:37:43,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:37:43,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:37:43,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:37:43,790 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:37:43,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:43,844 INFO L93 Difference]: Finished difference Result 180 states and 258 transitions. [2025-02-06 03:37:43,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:37:43,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-02-06 03:37:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:43,846 INFO L225 Difference]: With dead ends: 180 [2025-02-06 03:37:43,846 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 03:37:43,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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:37:43,847 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:43,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:37:43,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 03:37:43,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-02-06 03:37:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:37:43,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2025-02-06 03:37:43,854 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 89 [2025-02-06 03:37:43,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:43,855 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2025-02-06 03:37:43,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:37:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2025-02-06 03:37:43,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-06 03:37:43,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:43,856 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:43,867 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:37:44,056 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:37:44,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:44,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:44,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1026751026, now seen corresponding path program 1 times [2025-02-06 03:37:44,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:37:44,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242830937] [2025-02-06 03:37:44,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:44,058 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:37:44,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:37:44,062 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:37:44,063 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:37:44,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 03:37:44,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 03:37:44,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:44,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:44,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 03:37:44,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:37:44,480 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 77 treesize of output 41 [2025-02-06 03:37:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-02-06 03:37:44,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:37:44,508 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:37:44,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242830937] [2025-02-06 03:37:44,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242830937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:44,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:37:44,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:37:44,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724141526] [2025-02-06 03:37:44,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:44,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:37:44,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:37:44,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:37:44,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:37:44,510 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 03:37:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:44,971 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2025-02-06 03:37:44,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:37:44,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-02-06 03:37:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:44,972 INFO L225 Difference]: With dead ends: 184 [2025-02-06 03:37:44,972 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 03:37:44,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:37:44,973 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 112 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:44,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 433 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:37:44,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 03:37:44,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-02-06 03:37:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:37:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2025-02-06 03:37:44,978 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 89 [2025-02-06 03:37:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:44,979 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2025-02-06 03:37:44,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 03:37:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2025-02-06 03:37:44,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-06 03:37:44,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:44,980 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:44,992 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:37:45,180 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:37:45,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:45,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:45,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1973221904, now seen corresponding path program 1 times [2025-02-06 03:37:45,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:37:45,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220332657] [2025-02-06 03:37:45,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:45,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:37:45,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:37:45,185 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:37:45,186 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:37:45,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-06 03:37:45,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-06 03:37:45,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:45,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:45,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:37:45,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:37:46,056 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 74 treesize of output 38 [2025-02-06 03:37:46,113 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-06 03:37:46,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:37:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:37:46,203 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:37:46,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220332657] [2025-02-06 03:37:46,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220332657] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:37:46,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:37:46,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2025-02-06 03:37:46,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962486277] [2025-02-06 03:37:46,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:46,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:37:46,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:37:46,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:37:46,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:37:46,205 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:37:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:46,457 INFO L93 Difference]: Finished difference Result 181 states and 254 transitions. [2025-02-06 03:37:46,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:37:46,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2025-02-06 03:37:46,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:46,459 INFO L225 Difference]: With dead ends: 181 [2025-02-06 03:37:46,459 INFO L226 Difference]: Without dead ends: 91 [2025-02-06 03:37:46,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:37:46,460 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:46,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:37:46,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-06 03:37:46,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-06 03:37:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 80 states have internal predecessors, (108), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:37:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2025-02-06 03:37:46,464 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 91 [2025-02-06 03:37:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:46,464 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2025-02-06 03:37:46,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:37:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2025-02-06 03:37:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-06 03:37:46,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:46,466 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:46,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:37:46,670 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:37:46,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:46,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:46,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1260197109, now seen corresponding path program 1 times [2025-02-06 03:37:46,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:37:46,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423262037] [2025-02-06 03:37:46,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:46,672 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:37:46,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:37:46,677 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:37:46,678 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:37:46,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-06 03:37:46,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-06 03:37:46,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:46,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:47,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 03:37:47,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:37:47,562 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:37:47,564 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 86 treesize of output 50 [2025-02-06 03:37:47,690 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 70 treesize of output 34 [2025-02-06 03:37:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-06 03:37:47,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:37:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:37:47,835 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:37:47,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423262037] [2025-02-06 03:37:47,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423262037] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:37:47,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:37:47,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2025-02-06 03:37:47,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036908925] [2025-02-06 03:37:47,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:47,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:37:47,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:37:47,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:37:47,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:37:47,837 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:37:47,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:47,849 INFO L93 Difference]: Finished difference Result 177 states and 246 transitions. [2025-02-06 03:37:47,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:37:47,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-02-06 03:37:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:47,850 INFO L225 Difference]: With dead ends: 177 [2025-02-06 03:37:47,850 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 03:37:47,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:37:47,851 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:47,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:37:47,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 03:37:47,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 03:37:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 78 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:37:47,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 122 transitions. [2025-02-06 03:37:47,857 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 122 transitions. Word has length 96 [2025-02-06 03:37:47,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:47,857 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 122 transitions. [2025-02-06 03:37:47,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:37:47,857 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 122 transitions. [2025-02-06 03:37:47,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 03:37:47,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:47,858 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:47,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-06 03:37:48,063 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:37:48,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:48,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash 595312630, now seen corresponding path program 1 times [2025-02-06 03:37:48,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:37:48,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682917263] [2025-02-06 03:37:48,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:48,065 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:37:48,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:37:48,066 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:37:48,068 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:37:48,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:37:59,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:37:59,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:37:59,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:37:59,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:37:59,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:37:59,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:37:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:37:59,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:37:59,270 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:37:59,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682917263] [2025-02-06 03:37:59,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682917263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:37:59,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:37:59,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:37:59,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700421775] [2025-02-06 03:37:59,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:37:59,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:37:59,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:37:59,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:37:59,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:37:59,271 INFO L87 Difference]: Start difference. First operand 89 states and 122 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:37:59,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:37:59,593 INFO L93 Difference]: Finished difference Result 175 states and 241 transitions. [2025-02-06 03:37:59,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:37:59,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-02-06 03:37:59,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:37:59,594 INFO L225 Difference]: With dead ends: 175 [2025-02-06 03:37:59,594 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 03:37:59,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:37:59,595 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:37:59,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:37:59,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 03:37:59,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 03:37:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:37:59,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2025-02-06 03:37:59,599 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 101 [2025-02-06 03:37:59,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:37:59,599 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2025-02-06 03:37:59,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:37:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2025-02-06 03:37:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 03:37:59,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:37:59,601 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:59,619 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:37:59,801 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:37:59,801 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:37:59,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:37:59,802 INFO L85 PathProgramCache]: Analyzing trace with hash 606628757, now seen corresponding path program 1 times [2025-02-06 03:37:59,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:37:59,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268335649] [2025-02-06 03:37:59,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:37:59,802 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:37:59,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:37:59,805 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:37:59,806 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:37:59,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:38:48,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:38:48,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:48,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:48,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:38:48,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:38:48,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:38:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:38:48,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:38:48,562 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:38:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268335649] [2025-02-06 03:38:48,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268335649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:48,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:48,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:38:48,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095991379] [2025-02-06 03:38:48,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:48,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:38:48,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:38:48,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:38:48,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:38:48,563 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:38:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:48,789 INFO L93 Difference]: Finished difference Result 175 states and 239 transitions. [2025-02-06 03:38:48,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:38:48,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-02-06 03:38:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:48,791 INFO L225 Difference]: With dead ends: 175 [2025-02-06 03:38:48,791 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 03:38:48,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:38:48,792 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:48,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:38:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 03:38:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 03:38:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 78 states have internal predecessors, (102), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:38:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2025-02-06 03:38:48,801 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 101 [2025-02-06 03:38:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:48,801 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2025-02-06 03:38:48,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:38:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2025-02-06 03:38:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 03:38:48,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:48,802 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:48,857 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:38:49,003 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:38:49,003 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:49,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:49,004 INFO L85 PathProgramCache]: Analyzing trace with hash 351892212, now seen corresponding path program 1 times [2025-02-06 03:38:49,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:38:49,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395461384] [2025-02-06 03:38:49,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:49,004 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:38:49,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:38:49,006 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:38:49,010 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:38:49,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 03:38:57,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 03:38:57,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:38:57,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:38:57,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:38:57,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:38:57,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 03:38:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 03:38:57,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:38:57,691 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:38:57,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395461384] [2025-02-06 03:38:57,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395461384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:38:57,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:38:57,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:38:57,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643840726] [2025-02-06 03:38:57,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:38:57,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:38:57,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:38:57,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:38:57,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:38:57,693 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:38:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:38:57,969 INFO L93 Difference]: Finished difference Result 175 states and 237 transitions. [2025-02-06 03:38:57,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:38:57,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-02-06 03:38:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:38:57,972 INFO L225 Difference]: With dead ends: 175 [2025-02-06 03:38:57,972 INFO L226 Difference]: Without dead ends: 89 [2025-02-06 03:38:57,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:38:57,973 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:38:57,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:38:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-06 03:38:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-06 03:38:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 03:38:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2025-02-06 03:38:57,985 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 101 [2025-02-06 03:38:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:38:57,987 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2025-02-06 03:38:57,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 03:38:57,987 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2025-02-06 03:38:57,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 03:38:57,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:38:57,988 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:58,024 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:38:58,188 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:38:58,189 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:38:58,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:38:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash 382912019, now seen corresponding path program 1 times [2025-02-06 03:38:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:38:58,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008608331] [2025-02-06 03:38:58,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:38:58,191 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:38:58,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:38:58,193 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:38:58,194 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:38:58,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes.