./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-38.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-38.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 9436ed57987819903fc9546060edbc7fab121244510e369d708bc399b5aeace7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:39:14,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:39:14,564 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:39:14,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:39:14,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:39:14,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:39:14,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:39:14,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:39:14,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:39:14,595 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:39:14,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:39:14,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:39:14,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:39:14,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:39:14,597 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:39:14,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:39:14,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:39:14,598 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:39:14,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:39:14,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:39:14,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:39:14,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:39:14,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:39:14,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:39:14,598 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:39:14,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:39:14,598 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:39:14,598 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:39:14,598 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:39:14,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:39:14,599 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:39:14,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:39:14,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:39:14,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:39:14,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:39:14,599 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:39:14,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:39:14,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:39:14,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:39:14,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:39:14,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:39:14,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:39:14,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:39:14,600 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 -> 9436ed57987819903fc9546060edbc7fab121244510e369d708bc399b5aeace7 [2025-02-06 03:39:14,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:39:14,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:39:14,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:39:14,855 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:39:14,856 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:39:14,856 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-38.i [2025-02-06 03:39:16,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c05c634e/13a483c0706640f19098007a2fd11511/FLAGad1135c94 [2025-02-06 03:39:16,362 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:39:16,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-38.i [2025-02-06 03:39:16,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c05c634e/13a483c0706640f19098007a2fd11511/FLAGad1135c94 [2025-02-06 03:39:16,663 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c05c634e/13a483c0706640f19098007a2fd11511 [2025-02-06 03:39:16,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:39:16,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:39:16,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:39:16,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:39:16,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:39:16,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:39:16" (1/1) ... [2025-02-06 03:39:16,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7ee4ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:16, skipping insertion in model container [2025-02-06 03:39:16,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:39:16" (1/1) ... [2025-02-06 03:39:16,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:39:16,786 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-38.i[916,929] [2025-02-06 03:39:16,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:39:16,846 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:39:16,853 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-38.i[916,929] [2025-02-06 03:39:16,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:39:16,891 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:39:16,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:16 WrapperNode [2025-02-06 03:39:16,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:39:16,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:39:16,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:39:16,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:39:16,897 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:39:16" (1/1) ... [2025-02-06 03:39:16,911 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:39:16" (1/1) ... [2025-02-06 03:39:16,950 INFO L138 Inliner]: procedures = 29, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 545 [2025-02-06 03:39:16,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:39:16,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:39:16,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:39:16,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:39:16,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:16" (1/1) ... [2025-02-06 03:39:16,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:16" (1/1) ... [2025-02-06 03:39:16,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:16" (1/1) ... [2025-02-06 03:39:17,008 INFO L175 MemorySlicer]: Split 141 memory accesses to 20 slices as follows [2, 3, 12, 14, 8, 3, 6, 3, 8, 8, 8, 8, 7, 10, 12, 8, 6, 3, 6, 6]. 10 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 21 writes are split as follows [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1]. [2025-02-06 03:39:17,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:16" (1/1) ... [2025-02-06 03:39:17,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:16" (1/1) ... [2025-02-06 03:39:17,033 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:16" (1/1) ... [2025-02-06 03:39:17,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:16" (1/1) ... [2025-02-06 03:39:17,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:16" (1/1) ... [2025-02-06 03:39:17,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:16" (1/1) ... [2025-02-06 03:39:17,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:39:17,057 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:39:17,057 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:39:17,057 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:39:17,058 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:16" (1/1) ... [2025-02-06 03:39:17,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:39:17,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:17,087 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:39:17,091 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:39:17,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:39:17,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:39:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:39:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:39:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:39:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:39:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:39:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-06 03:39:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-02-06 03:39:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-02-06 03:39:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-02-06 03:39:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#17 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#18 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#19 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:39:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2025-02-06 03:39:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2025-02-06 03:39:17,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#17 [2025-02-06 03:39:17,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#18 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#19 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-02-06 03:39:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#17 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#18 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#19 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:39:17,114 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-06 03:39:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:39:17,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:39:17,274 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:39:17,276 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:39:17,544 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc property_#t~mem103#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~short111#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short117#1;havoc property_#t~mem118#1;havoc property_#t~ite132#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~ite131#1;havoc property_#t~mem128#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite127#1;havoc property_#t~mem126#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short136#1;havoc property_#t~mem137#1;havoc property_#t~short138#1;havoc property_#t~ite142#1;havoc property_#t~mem141#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~short143#1; [2025-02-06 03:39:17,587 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2025-02-06 03:39:17,587 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:39:17,596 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:39:17,597 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:39:17,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:17 BoogieIcfgContainer [2025-02-06 03:39:17,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:39:17,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:39:17,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:39:17,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:39:17,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:39:16" (1/3) ... [2025-02-06 03:39:17,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb6556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:39:17, skipping insertion in model container [2025-02-06 03:39:17,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:16" (2/3) ... [2025-02-06 03:39:17,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb6556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:39:17, skipping insertion in model container [2025-02-06 03:39:17,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:17" (3/3) ... [2025-02-06 03:39:17,604 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-38.i [2025-02-06 03:39:17,614 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:39:17,616 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-38.i that has 2 procedures, 121 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:39:17,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:39:17,661 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;@512675ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:39:17,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:39:17,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:39:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:39:17,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:17,673 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:17,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:17,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1489406202, now seen corresponding path program 1 times [2025-02-06 03:39:17,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:17,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954471560] [2025-02-06 03:39:17,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:17,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:17,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:39:17,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:39:17,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:17,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-06 03:39:18,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:18,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954471560] [2025-02-06 03:39:18,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954471560] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:18,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819214238] [2025-02-06 03:39:18,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:18,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:18,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:18,038 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:39:18,040 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:39:18,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:39:18,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:39:18,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:18,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:18,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:39:18,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-06 03:39:18,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:18,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819214238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:18,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:18,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:39:18,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554129097] [2025-02-06 03:39:18,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:18,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:39:18,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:18,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:39:18,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:39:18,387 INFO L87 Difference]: Start difference. First operand has 121 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 03:39:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:18,406 INFO L93 Difference]: Finished difference Result 236 states and 373 transitions. [2025-02-06 03:39:18,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:39:18,407 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2025-02-06 03:39:18,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:18,412 INFO L225 Difference]: With dead ends: 236 [2025-02-06 03:39:18,412 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 03:39:18,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 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:39:18,417 INFO L435 NwaCegarLoop]: 172 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, 172 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:39:18,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 03:39:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-06 03:39:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:39:18,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2025-02-06 03:39:18,445 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2025-02-06 03:39:18,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:18,445 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2025-02-06 03:39:18,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 03:39:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2025-02-06 03:39:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:39:18,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:18,448 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:18,456 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:39:18,648 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:39:18,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:18,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:18,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1852933594, now seen corresponding path program 1 times [2025-02-06 03:39:18,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:18,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838296661] [2025-02-06 03:39:18,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:18,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:18,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:39:18,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:39:18,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:18,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 03:39:18,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:18,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838296661] [2025-02-06 03:39:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838296661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:18,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:18,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:39:18,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963154215] [2025-02-06 03:39:18,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:18,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:39:18,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:18,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:39:18,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:39:18,952 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:39:18,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:18,982 INFO L93 Difference]: Finished difference Result 236 states and 345 transitions. [2025-02-06 03:39:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:39:18,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2025-02-06 03:39:18,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:18,987 INFO L225 Difference]: With dead ends: 236 [2025-02-06 03:39:18,987 INFO L226 Difference]: Without dead ends: 121 [2025-02-06 03:39:18,988 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:39:18,988 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:18,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-06 03:39:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-02-06 03:39:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 94 states have internal predecessors, (126), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:39:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2025-02-06 03:39:18,996 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 184 [2025-02-06 03:39:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:18,997 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2025-02-06 03:39:18,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:39:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2025-02-06 03:39:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:39:18,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:18,999 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:18,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:39:18,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:18,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:18,999 INFO L85 PathProgramCache]: Analyzing trace with hash 45479131, now seen corresponding path program 1 times [2025-02-06 03:39:18,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:19,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206829566] [2025-02-06 03:39:19,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:19,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:19,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:39:19,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:39:19,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:19,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 03:39:19,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:19,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206829566] [2025-02-06 03:39:19,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206829566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:19,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:19,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:39:19,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911754329] [2025-02-06 03:39:19,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:19,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:39:19,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:19,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:39:19,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:39:19,599 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:39:19,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:19,735 INFO L93 Difference]: Finished difference Result 322 states and 468 transitions. [2025-02-06 03:39:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:39:19,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2025-02-06 03:39:19,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:19,741 INFO L225 Difference]: With dead ends: 322 [2025-02-06 03:39:19,741 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 03:39:19,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:39:19,742 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 119 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:19,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 616 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:19,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 03:39:19,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2025-02-06 03:39:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 163 states have (on average 1.3496932515337423) internal successors, (220), 164 states have internal predecessors, (220), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:39:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 292 transitions. [2025-02-06 03:39:19,771 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 292 transitions. Word has length 184 [2025-02-06 03:39:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:19,771 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 292 transitions. [2025-02-06 03:39:19,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:39:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 292 transitions. [2025-02-06 03:39:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:39:19,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:19,776 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:19,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:39:19,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:19,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1042496763, now seen corresponding path program 1 times [2025-02-06 03:39:19,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:19,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832919137] [2025-02-06 03:39:19,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:19,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:19,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:39:19,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:39:19,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:19,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 03:39:21,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:21,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832919137] [2025-02-06 03:39:21,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832919137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:21,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:21,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 03:39:21,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506864992] [2025-02-06 03:39:21,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:21,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:39:21,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:21,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:39:21,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:39:21,368 INFO L87 Difference]: Start difference. First operand 202 states and 292 transitions. Second operand has 13 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-06 03:39:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:22,014 INFO L93 Difference]: Finished difference Result 483 states and 696 transitions. [2025-02-06 03:39:22,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:39:22,015 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) Word has length 184 [2025-02-06 03:39:22,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:22,017 INFO L225 Difference]: With dead ends: 483 [2025-02-06 03:39:22,017 INFO L226 Difference]: Without dead ends: 284 [2025-02-06 03:39:22,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:39:22,018 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 457 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:22,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1230 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:39:22,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-06 03:39:22,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 224. [2025-02-06 03:39:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 185 states have (on average 1.3513513513513513) internal successors, (250), 186 states have internal predecessors, (250), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:39:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 322 transitions. [2025-02-06 03:39:22,033 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 322 transitions. Word has length 184 [2025-02-06 03:39:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:22,033 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 322 transitions. [2025-02-06 03:39:22,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 3 states have call successors, (24) [2025-02-06 03:39:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 322 transitions. [2025-02-06 03:39:22,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:39:22,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:22,040 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:22,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:39:22,040 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:22,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:22,041 INFO L85 PathProgramCache]: Analyzing trace with hash 749093756, now seen corresponding path program 1 times [2025-02-06 03:39:22,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:22,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676240553] [2025-02-06 03:39:22,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:22,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:22,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:39:22,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:39:22,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:22,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 03:39:22,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:22,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676240553] [2025-02-06 03:39:22,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676240553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:22,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:22,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:39:22,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901918156] [2025-02-06 03:39:22,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:22,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:39:22,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:22,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:39:22,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:39:22,506 INFO L87 Difference]: Start difference. First operand 224 states and 322 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:39:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:22,639 INFO L93 Difference]: Finished difference Result 573 states and 820 transitions. [2025-02-06 03:39:22,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:39:22,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2025-02-06 03:39:22,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:22,644 INFO L225 Difference]: With dead ends: 573 [2025-02-06 03:39:22,644 INFO L226 Difference]: Without dead ends: 352 [2025-02-06 03:39:22,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:39:22,645 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 124 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:22,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 928 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:39:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-06 03:39:22,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 240. [2025-02-06 03:39:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 201 states have (on average 1.3383084577114428) internal successors, (269), 202 states have internal predecessors, (269), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:39:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 341 transitions. [2025-02-06 03:39:22,674 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 341 transitions. Word has length 184 [2025-02-06 03:39:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:22,675 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 341 transitions. [2025-02-06 03:39:22,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:39:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 341 transitions. [2025-02-06 03:39:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:39:22,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:22,677 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:22,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:39:22,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:22,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:22,678 INFO L85 PathProgramCache]: Analyzing trace with hash 633672538, now seen corresponding path program 1 times [2025-02-06 03:39:22,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:22,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997132432] [2025-02-06 03:39:22,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:22,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:22,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:39:22,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:39:22,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:22,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 03:39:23,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:23,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997132432] [2025-02-06 03:39:23,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997132432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:23,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:23,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:39:23,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974002831] [2025-02-06 03:39:23,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:23,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:39:23,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:23,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:39:23,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:39:23,301 INFO L87 Difference]: Start difference. First operand 240 states and 341 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:39:23,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:23,540 INFO L93 Difference]: Finished difference Result 533 states and 758 transitions. [2025-02-06 03:39:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:39:23,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2025-02-06 03:39:23,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:23,543 INFO L225 Difference]: With dead ends: 533 [2025-02-06 03:39:23,543 INFO L226 Difference]: Without dead ends: 296 [2025-02-06 03:39:23,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:39:23,547 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 50 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:23,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1293 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:39:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-02-06 03:39:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 224. [2025-02-06 03:39:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 185 states have (on average 1.3405405405405406) internal successors, (248), 186 states have internal predecessors, (248), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:39:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 320 transitions. [2025-02-06 03:39:23,563 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 320 transitions. Word has length 184 [2025-02-06 03:39:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:23,563 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 320 transitions. [2025-02-06 03:39:23,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:39:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 320 transitions. [2025-02-06 03:39:23,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:39:23,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:23,565 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:23,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:39:23,565 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:23,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:23,566 INFO L85 PathProgramCache]: Analyzing trace with hash -995559526, now seen corresponding path program 1 times [2025-02-06 03:39:23,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:23,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873473973] [2025-02-06 03:39:23,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:23,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:23,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:39:23,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:39:23,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:23,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:24,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 03:39:24,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:24,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873473973] [2025-02-06 03:39:24,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873473973] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:24,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:24,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 03:39:24,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941430284] [2025-02-06 03:39:24,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:24,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:39:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:24,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:39:24,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:39:24,584 INFO L87 Difference]: Start difference. First operand 224 states and 320 transitions. Second operand has 14 states, 11 states have (on average 6.090909090909091) internal successors, (67), 13 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:39:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:25,186 INFO L93 Difference]: Finished difference Result 499 states and 712 transitions. [2025-02-06 03:39:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:39:25,187 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 6.090909090909091) internal successors, (67), 13 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 184 [2025-02-06 03:39:25,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:25,188 INFO L225 Difference]: With dead ends: 499 [2025-02-06 03:39:25,189 INFO L226 Difference]: Without dead ends: 278 [2025-02-06 03:39:25,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:39:25,190 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 251 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:25,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 1080 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:39:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-02-06 03:39:25,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 224. [2025-02-06 03:39:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 185 states have (on average 1.3297297297297297) internal successors, (246), 186 states have internal predecessors, (246), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:39:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 318 transitions. [2025-02-06 03:39:25,202 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 318 transitions. Word has length 184 [2025-02-06 03:39:25,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:25,202 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 318 transitions. [2025-02-06 03:39:25,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 6.090909090909091) internal successors, (67), 13 states have internal predecessors, (67), 6 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 03:39:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 318 transitions. [2025-02-06 03:39:25,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:39:25,204 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:25,204 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:25,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:39:25,204 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:25,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:25,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1288962533, now seen corresponding path program 1 times [2025-02-06 03:39:25,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:25,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489632475] [2025-02-06 03:39:25,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:25,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:39:25,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:39:25,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:25,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 03:39:26,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:26,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489632475] [2025-02-06 03:39:26,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489632475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:26,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:26,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:39:26,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085646497] [2025-02-06 03:39:26,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:26,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:39:26,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:26,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:39:26,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:39:26,202 INFO L87 Difference]: Start difference. First operand 224 states and 318 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:39:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:26,583 INFO L93 Difference]: Finished difference Result 509 states and 720 transitions. [2025-02-06 03:39:26,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:39:26,584 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2025-02-06 03:39:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:26,588 INFO L225 Difference]: With dead ends: 509 [2025-02-06 03:39:26,588 INFO L226 Difference]: Without dead ends: 288 [2025-02-06 03:39:26,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:39:26,591 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 59 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:26,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1595 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:39:26,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-06 03:39:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 284. [2025-02-06 03:39:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 239 states have (on average 1.3389121338912133) internal successors, (320), 242 states have internal predecessors, (320), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:39:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 400 transitions. [2025-02-06 03:39:26,615 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 400 transitions. Word has length 184 [2025-02-06 03:39:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:26,617 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 400 transitions. [2025-02-06 03:39:26,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:39:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 400 transitions. [2025-02-06 03:39:26,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-06 03:39:26,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:26,622 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:26,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:39:26,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:26,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:26,623 INFO L85 PathProgramCache]: Analyzing trace with hash -13731400, now seen corresponding path program 1 times [2025-02-06 03:39:26,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:26,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411238827] [2025-02-06 03:39:26,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:26,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:26,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-06 03:39:26,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-06 03:39:26,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:26,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:27,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 18 proven. 114 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2025-02-06 03:39:27,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:39:27,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411238827] [2025-02-06 03:39:27,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411238827] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:27,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021511997] [2025-02-06 03:39:27,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:27,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:27,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:27,923 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:39:27,925 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:39:28,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-06 03:39:28,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-06 03:39:28,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:28,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:28,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-06 03:39:28,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:28,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-02-06 03:39:28,512 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:39:28,673 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:39:29,406 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:39:29,494 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:39:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 20 proven. 464 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2025-02-06 03:39:29,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:30,393 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 48 treesize of output 44 [2025-02-06 03:39:30,750 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 48 treesize of output 44 [2025-02-06 03:39:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 18 proven. 117 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-02-06 03:39:31,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021511997] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:39:31,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:39:31,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 44 [2025-02-06 03:39:31,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921598530] [2025-02-06 03:39:31,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:39:31,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-06 03:39:31,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:39:31,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-06 03:39:31,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1672, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 03:39:31,400 INFO L87 Difference]: Start difference. First operand 284 states and 400 transitions. Second operand has 44 states, 37 states have (on average 5.486486486486487) internal successors, (203), 40 states have internal predecessors, (203), 17 states have call successors, (72), 6 states have call predecessors, (72), 9 states have return successors, (72), 12 states have call predecessors, (72), 17 states have call successors, (72) [2025-02-06 03:39:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:32,979 INFO L93 Difference]: Finished difference Result 591 states and 818 transitions. [2025-02-06 03:39:32,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 03:39:32,980 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 37 states have (on average 5.486486486486487) internal successors, (203), 40 states have internal predecessors, (203), 17 states have call successors, (72), 6 states have call predecessors, (72), 9 states have return successors, (72), 12 states have call predecessors, (72), 17 states have call successors, (72) Word has length 186 [2025-02-06 03:39:32,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:32,982 INFO L225 Difference]: With dead ends: 591 [2025-02-06 03:39:32,982 INFO L226 Difference]: Without dead ends: 310 [2025-02-06 03:39:32,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=796, Invalid=3626, Unknown=0, NotChecked=0, Total=4422 [2025-02-06 03:39:32,985 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1063 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:32,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1783 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:39:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-06 03:39:33,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 300. [2025-02-06 03:39:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 251 states have (on average 1.3107569721115537) internal successors, (329), 254 states have internal predecessors, (329), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:39:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 409 transitions. [2025-02-06 03:39:33,007 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 409 transitions. Word has length 186 [2025-02-06 03:39:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:33,007 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 409 transitions. [2025-02-06 03:39:33,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 37 states have (on average 5.486486486486487) internal successors, (203), 40 states have internal predecessors, (203), 17 states have call successors, (72), 6 states have call predecessors, (72), 9 states have return successors, (72), 12 states have call predecessors, (72), 17 states have call successors, (72) [2025-02-06 03:39:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 409 transitions. [2025-02-06 03:39:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-06 03:39:33,009 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:33,009 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:33,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 03:39:33,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:39:33,214 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:33,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:33,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1922704970, now seen corresponding path program 1 times [2025-02-06 03:39:33,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:39:33,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228677026] [2025-02-06 03:39:33,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:33,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:39:33,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-06 03:39:33,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-06 03:39:33,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:33,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:39:33,304 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:39:33,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-06 03:39:33,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-06 03:39:33,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:33,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:39:33,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:39:33,513 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:39:33,514 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:39:33,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:39:33,519 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:39:33,800 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:39:33,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:39:33 BoogieIcfgContainer [2025-02-06 03:39:33,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:39:33,803 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:39:33,803 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:39:33,803 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:39:33,804 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:17" (3/4) ... [2025-02-06 03:39:33,805 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:39:33,805 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:39:33,806 INFO L158 Benchmark]: Toolchain (without parser) took 17139.70ms. Allocated memory was 167.8MB in the beginning and 595.6MB in the end (delta: 427.8MB). Free memory was 121.6MB in the beginning and 507.2MB in the end (delta: -385.6MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2025-02-06 03:39:33,806 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:39:33,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.91ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 107.0MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:39:33,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.39ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 102.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:39:33,807 INFO L158 Benchmark]: Boogie Preprocessor took 103.37ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 96.5MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:39:33,807 INFO L158 Benchmark]: IcfgBuilder took 540.60ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 50.4MB in the end (delta: 46.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 03:39:33,807 INFO L158 Benchmark]: TraceAbstraction took 16203.31ms. Allocated memory was 167.8MB in the beginning and 595.6MB in the end (delta: 427.8MB). Free memory was 49.7MB in the beginning and 507.3MB in the end (delta: -457.7MB). Peak memory consumption was 289.6MB. Max. memory is 16.1GB. [2025-02-06 03:39:33,807 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 595.6MB. Free memory was 507.3MB in the beginning and 507.2MB in the end (delta: 120.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:39:33,808 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.91ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 107.0MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.39ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 102.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 103.37ms. Allocated memory is still 167.8MB. Free memory was 102.8MB in the beginning and 96.5MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 540.60ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 50.4MB in the end (delta: 46.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16203.31ms. Allocated memory was 167.8MB in the beginning and 595.6MB in the end (delta: 427.8MB). Free memory was 49.7MB in the beginning and 507.3MB in the end (delta: -457.7MB). Peak memory consumption was 289.6MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 595.6MB. Free memory was 507.3MB in the beginning and 507.2MB in the end (delta: 120.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned short int var_1_2 = 56507; [L24] unsigned short int var_1_2 = 56507; [L25] unsigned short int* var_1_2_Pointer = &(var_1_2); [L26] unsigned short int var_1_3 = 52902; [L26] unsigned short int var_1_3 = 52902; [L27] unsigned short int* var_1_3_Pointer = &(var_1_3); [L28] unsigned short int var_1_4 = 8; [L28] unsigned short int var_1_4 = 8; [L29] unsigned short int* var_1_4_Pointer = &(var_1_4); [L30] unsigned long int var_1_5 = 16; [L30] unsigned long int var_1_5 = 16; [L31] unsigned long int* var_1_5_Pointer = &(var_1_5); [L32] unsigned long int var_1_6 = 1771558822; [L32] unsigned long int var_1_6 = 1771558822; [L33] unsigned long int* var_1_6_Pointer = &(var_1_6); [L34] double var_1_7 = 7.25; [L34] double var_1_7 = 7.25; [L35] double* var_1_7_Pointer = &(var_1_7); [L36] double var_1_8 = 31.2; [L36] double var_1_8 = 31.2; [L37] double* var_1_8_Pointer = &(var_1_8); [L38] double var_1_9 = 32.71; [L38] double var_1_9 = 32.71; [L39] double* var_1_9_Pointer = &(var_1_9); [L40] double var_1_10 = 0.4; [L40] double var_1_10 = 0.4; [L41] double* var_1_10_Pointer = &(var_1_10); [L42] double var_1_11 = 7.75; [L42] double var_1_11 = 7.75; [L43] double* var_1_11_Pointer = &(var_1_11); [L44] unsigned short int var_1_12 = 32; [L44] unsigned short int var_1_12 = 32; [L45] unsigned short int* var_1_12_Pointer = &(var_1_12); [L46] unsigned char var_1_13 = 0; [L46] unsigned char var_1_13 = 0; [L47] unsigned char* var_1_13_Pointer = &(var_1_13); [L48] unsigned short int var_1_14 = 20114; [L48] unsigned short int var_1_14 = 20114; [L49] unsigned short int* var_1_14_Pointer = &(var_1_14); [L50] unsigned short int var_1_15 = 32; [L50] unsigned short int var_1_15 = 32; [L51] unsigned short int* var_1_15_Pointer = &(var_1_15); [L52] unsigned short int var_1_16 = 16773; [L52] unsigned short int var_1_16 = 16773; [L53] unsigned short int* var_1_16_Pointer = &(var_1_16); [L54] unsigned short int var_1_17 = 25; [L54] unsigned short int var_1_17 = 25; [L55] unsigned short int* var_1_17_Pointer = &(var_1_17); [L56] unsigned char var_1_18 = 0; [L56] unsigned char var_1_18 = 0; [L57] unsigned char* var_1_18_Pointer = &(var_1_18); [L58] unsigned char var_1_19 = 1; [L58] unsigned char var_1_19 = 1; [L59] unsigned char* var_1_19_Pointer = &(var_1_19); VAL [isInitial=0, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L130] isInitial = 1 [L131] FCALL initially() [L132] COND TRUE 1 [L133] FCALL updateLastVariables() [L134] CALL updateVariables() [L84] var_1_2 = __VERIFIER_nondet_ushort() [L85] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L85] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L86] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L86] CALL assume_abort_if_not(var_1_2 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L86] RET assume_abort_if_not(var_1_2 <= 65534) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L87] var_1_3 = __VERIFIER_nondet_ushort() [L88] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L88] CALL assume_abort_if_not(var_1_3 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L88] RET assume_abort_if_not(var_1_3 >= 32767) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L89] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L90] var_1_4 = __VERIFIER_nondet_ushort() [L91] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L91] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] EXPR \read(var_1_4) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L92] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L93] var_1_6 = __VERIFIER_nondet_ulong() [L94] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L94] CALL assume_abort_if_not(var_1_6 >= 1610612735) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L94] RET assume_abort_if_not(var_1_6 >= 1610612735) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L95] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L96] var_1_8 = __VERIFIER_nondet_double() [L97] EXPR \read(var_1_8) [L97] EXPR var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] EXPR var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F [L97] EXPR \read(var_1_8) [L97] EXPR var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] EXPR (var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] EXPR (var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L97] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L98] var_1_9 = __VERIFIER_nondet_double() [L99] EXPR \read(var_1_9) [L99] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F [L99] EXPR \read(var_1_9) [L99] EXPR var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] EXPR (var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] EXPR (var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L99] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L100] var_1_10 = __VERIFIER_nondet_double() [L101] EXPR \read(var_1_10) [L101] EXPR var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F [L101] EXPR \read(var_1_10) [L101] EXPR var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR (var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] EXPR (var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] CALL assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L101] RET assume_abort_if_not((var_1_10 >= -115292.1504606845700e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 1152921.504606845700e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L102] var_1_11 = __VERIFIER_nondet_double() [L103] EXPR \read(var_1_11) [L103] EXPR var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L103] EXPR var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F [L103] EXPR \read(var_1_11) [L103] EXPR var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L103] EXPR (var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L103] EXPR (var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L103] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L103] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L104] var_1_13 = __VERIFIER_nondet_uchar() [L105] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L105] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L105] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L106] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L107] var_1_14 = __VERIFIER_nondet_ushort() [L108] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L108] CALL assume_abort_if_not(var_1_14 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L108] RET assume_abort_if_not(var_1_14 >= 16383) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L109] EXPR \read(var_1_14) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L109] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L109] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L110] var_1_15 = __VERIFIER_nondet_ushort() [L111] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L111] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L111] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L112] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L112] CALL assume_abort_if_not(var_1_15 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L112] RET assume_abort_if_not(var_1_15 <= 16383) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L113] var_1_16 = __VERIFIER_nondet_ushort() [L114] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L114] CALL assume_abort_if_not(var_1_16 >= 16384) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L114] RET assume_abort_if_not(var_1_16 >= 16384) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L115] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L115] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L115] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L116] var_1_18 = __VERIFIER_nondet_uchar() [L117] EXPR \read(var_1_18) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L117] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L118] EXPR \read(var_1_18) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L118] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L118] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L119] var_1_19 = __VERIFIER_nondet_uchar() [L120] EXPR \read(var_1_19) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L120] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L120] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L121] EXPR \read(var_1_19) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L121] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L121] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L134] RET updateVariables() [L135] CALL step() [L63] EXPR \read(*var_1_2_Pointer) [L63] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L63] EXPR (((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) [L63] EXPR \read(*var_1_2_Pointer) [L63] EXPR (((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L63] EXPR \read(*var_1_4_Pointer) [L63] (*(var_1_1_Pointer)) = ((((((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) - (*(var_1_4_Pointer))) [L64] EXPR \read(*var_1_2_Pointer) [L64] unsigned short int stepLocal_0 = (*(var_1_2_Pointer)); [L65] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L65] COND FALSE !((*(var_1_4_Pointer)) > stepLocal_0) [L68] EXPR \read(*var_1_8_Pointer) [L68] EXPR \read(*var_1_9_Pointer) [L68] EXPR \read(*var_1_10_Pointer) [L68] EXPR \read(*var_1_11_Pointer) [L68] (*(var_1_7_Pointer)) = ((*(var_1_8_Pointer)) + ((*(var_1_9_Pointer)) + ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))) [L69] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L69] COND TRUE ! (*(var_1_13_Pointer)) [L70] EXPR \read(*var_1_3_Pointer) [L70] EXPR \read(*var_1_14_Pointer) [L70] EXPR \read(*var_1_15_Pointer) [L70] (*(var_1_12_Pointer)) = ((*(var_1_3_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))) [L78] EXPR \read(*var_1_19_Pointer) [L78] unsigned char stepLocal_1 = (*(var_1_19_Pointer)); [L79] EXPR \read(*var_1_13_Pointer) [L79] EXPR (*(var_1_13_Pointer)) && (*(var_1_18_Pointer)) VAL [isInitial=1, stepLocal_1=256, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L79] EXPR (*(var_1_13_Pointer)) && (*(var_1_18_Pointer)) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L79] COND FALSE !(((*(var_1_13_Pointer)) && (*(var_1_18_Pointer))) && stepLocal_1) [L135] RET step() [L136] CALL, EXPR property() [L126] EXPR \read(*var_1_1_Pointer) [L126] EXPR \read(*var_1_2_Pointer) [L126] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L126] EXPR (((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) [L126] EXPR \read(*var_1_2_Pointer) [L126] EXPR (((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L126] EXPR \read(*var_1_4_Pointer) [L126] EXPR ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) - (*(var_1_4_Pointer))))) && (((*(var_1_4_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_5_Pointer)) == ((unsigned long int) ((((*(var_1_6_Pointer)) - (*(var_1_3_Pointer))) + 2144048120u) - (*(var_1_2_Pointer))))) : 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L126] EXPR ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) - (*(var_1_4_Pointer))))) && (((*(var_1_4_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_5_Pointer)) == ((unsigned long int) ((((*(var_1_6_Pointer)) - (*(var_1_3_Pointer))) + 2144048120u) - (*(var_1_2_Pointer))))) : 1) [L126] EXPR \read(*var_1_4_Pointer) [L126] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L126] EXPR ((*(var_1_4_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_5_Pointer)) == ((unsigned long int) ((((*(var_1_6_Pointer)) - (*(var_1_3_Pointer))) + 2144048120u) - (*(var_1_2_Pointer))))) : 1 [L126] EXPR ((*(var_1_4_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_5_Pointer)) == ((unsigned long int) ((((*(var_1_6_Pointer)) - (*(var_1_3_Pointer))) + 2144048120u) - (*(var_1_2_Pointer))))) : 1 VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L126] EXPR ((*(var_1_1_Pointer)) == ((unsigned short int) ((((((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) - (*(var_1_4_Pointer))))) && (((*(var_1_4_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_5_Pointer)) == ((unsigned long int) ((((*(var_1_6_Pointer)) - (*(var_1_3_Pointer))) + 2144048120u) - (*(var_1_2_Pointer))))) : 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L126] EXPR (((*(var_1_1_Pointer)) == ((unsigned short int) ((((((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) - (*(var_1_4_Pointer))))) && (((*(var_1_4_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_5_Pointer)) == ((unsigned long int) ((((*(var_1_6_Pointer)) - (*(var_1_3_Pointer))) + 2144048120u) - (*(var_1_2_Pointer))))) : 1)) && ((*(var_1_7_Pointer)) == ((double) ((*(var_1_8_Pointer)) + ((*(var_1_9_Pointer)) + ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L126] EXPR (((*(var_1_1_Pointer)) == ((unsigned short int) ((((((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) - (*(var_1_4_Pointer))))) && (((*(var_1_4_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_5_Pointer)) == ((unsigned long int) ((((*(var_1_6_Pointer)) - (*(var_1_3_Pointer))) + 2144048120u) - (*(var_1_2_Pointer))))) : 1)) && ((*(var_1_7_Pointer)) == ((double) ((*(var_1_8_Pointer)) + ((*(var_1_9_Pointer)) + ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) [L126] EXPR \read(*var_1_7_Pointer) [L126] EXPR \read(*var_1_8_Pointer) [L126] EXPR \read(*var_1_9_Pointer) [L126] EXPR \read(*var_1_10_Pointer) [L126] EXPR \read(*var_1_11_Pointer) [L126] EXPR (((*(var_1_1_Pointer)) == ((unsigned short int) ((((((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) - (*(var_1_4_Pointer))))) && (((*(var_1_4_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_5_Pointer)) == ((unsigned long int) ((((*(var_1_6_Pointer)) - (*(var_1_3_Pointer))) + 2144048120u) - (*(var_1_2_Pointer))))) : 1)) && ((*(var_1_7_Pointer)) == ((double) ((*(var_1_8_Pointer)) + ((*(var_1_9_Pointer)) + ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L126] EXPR ((((*(var_1_1_Pointer)) == ((unsigned short int) ((((((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) - (*(var_1_4_Pointer))))) && (((*(var_1_4_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_5_Pointer)) == ((unsigned long int) ((((*(var_1_6_Pointer)) - (*(var_1_3_Pointer))) + 2144048120u) - (*(var_1_2_Pointer))))) : 1)) && ((*(var_1_7_Pointer)) == ((double) ((*(var_1_8_Pointer)) + ((*(var_1_9_Pointer)) + ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer)))))))) && ((! (*(var_1_13_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_3_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : ((*(var_1_13_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((27636 + (*(var_1_16_Pointer))) - (((((16853 - 10)) > ((*(var_1_14_Pointer)))) ? ((16853 - 10)) : ((*(var_1_14_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L126] EXPR ((((*(var_1_1_Pointer)) == ((unsigned short int) ((((((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) - (*(var_1_4_Pointer))))) && (((*(var_1_4_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_5_Pointer)) == ((unsigned long int) ((((*(var_1_6_Pointer)) - (*(var_1_3_Pointer))) + 2144048120u) - (*(var_1_2_Pointer))))) : 1)) && ((*(var_1_7_Pointer)) == ((double) ((*(var_1_8_Pointer)) + ((*(var_1_9_Pointer)) + ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer)))))))) && ((! (*(var_1_13_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_3_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : ((*(var_1_13_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((27636 + (*(var_1_16_Pointer))) - (((((16853 - 10)) > ((*(var_1_14_Pointer)))) ? ((16853 - 10)) : ((*(var_1_14_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer)))))) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L126] EXPR (((((*(var_1_1_Pointer)) == ((unsigned short int) ((((((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) - (*(var_1_4_Pointer))))) && (((*(var_1_4_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_5_Pointer)) == ((unsigned long int) ((((*(var_1_6_Pointer)) - (*(var_1_3_Pointer))) + 2144048120u) - (*(var_1_2_Pointer))))) : 1)) && ((*(var_1_7_Pointer)) == ((double) ((*(var_1_8_Pointer)) + ((*(var_1_9_Pointer)) + ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer)))))))) && ((! (*(var_1_13_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_3_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : ((*(var_1_13_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((27636 + (*(var_1_16_Pointer))) - (((((16853 - 10)) > ((*(var_1_14_Pointer)))) ? ((16853 - 10)) : ((*(var_1_14_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer))))))) && ((((*(var_1_13_Pointer)) && (*(var_1_18_Pointer))) && (*(var_1_19_Pointer))) ? ((*(var_1_17_Pointer)) == ((unsigned short int) ((*(var_1_15_Pointer)) + (*(var_1_14_Pointer))))) : 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L126] EXPR (((((*(var_1_1_Pointer)) == ((unsigned short int) ((((((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) - (*(var_1_4_Pointer))))) && (((*(var_1_4_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_5_Pointer)) == ((unsigned long int) ((((*(var_1_6_Pointer)) - (*(var_1_3_Pointer))) + 2144048120u) - (*(var_1_2_Pointer))))) : 1)) && ((*(var_1_7_Pointer)) == ((double) ((*(var_1_8_Pointer)) + ((*(var_1_9_Pointer)) + ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer)))))))) && ((! (*(var_1_13_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_3_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : ((*(var_1_13_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((27636 + (*(var_1_16_Pointer))) - (((((16853 - 10)) > ((*(var_1_14_Pointer)))) ? ((16853 - 10)) : ((*(var_1_14_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer))))))) && ((((*(var_1_13_Pointer)) && (*(var_1_18_Pointer))) && (*(var_1_19_Pointer))) ? ((*(var_1_17_Pointer)) == ((unsigned short int) ((*(var_1_15_Pointer)) + (*(var_1_14_Pointer))))) : 1) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L126-L127] return (((((*(var_1_1_Pointer)) == ((unsigned short int) ((((((*(var_1_2_Pointer))) > ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) - (*(var_1_4_Pointer))))) && (((*(var_1_4_Pointer)) > (*(var_1_2_Pointer))) ? ((*(var_1_5_Pointer)) == ((unsigned long int) ((((*(var_1_6_Pointer)) - (*(var_1_3_Pointer))) + 2144048120u) - (*(var_1_2_Pointer))))) : 1)) && ((*(var_1_7_Pointer)) == ((double) ((*(var_1_8_Pointer)) + ((*(var_1_9_Pointer)) + ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer)))))))) && ((! (*(var_1_13_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((*(var_1_3_Pointer)) - ((*(var_1_14_Pointer)) - (*(var_1_15_Pointer)))))) : ((*(var_1_13_Pointer)) ? ((*(var_1_12_Pointer)) == ((unsigned short int) ((27636 + (*(var_1_16_Pointer))) - (((((16853 - 10)) > ((*(var_1_14_Pointer)))) ? ((16853 - 10)) : ((*(var_1_14_Pointer)))))))) : ((*(var_1_12_Pointer)) == ((unsigned short int) (*(var_1_3_Pointer))))))) && ((((*(var_1_13_Pointer)) && (*(var_1_18_Pointer))) && (*(var_1_19_Pointer))) ? ((*(var_1_17_Pointer)) == ((unsigned short int) ((*(var_1_15_Pointer)) + (*(var_1_14_Pointer))))) : 1) ; [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={13:0}, var_1_10_Pointer={13:0}, var_1_11={14:0}, var_1_11_Pointer={14:0}, var_1_12={15:0}, var_1_12_Pointer={15:0}, var_1_13={16:0}, var_1_13_Pointer={16:0}, var_1_14={17:0}, var_1_14_Pointer={17:0}, var_1_15={18:0}, var_1_15_Pointer={18:0}, var_1_16={19:0}, var_1_16_Pointer={19:0}, var_1_17={20:0}, var_1_17_Pointer={20:0}, var_1_18={21:0}, var_1_18_Pointer={21:0}, var_1_19={22:0}, var_1_19_Pointer={22:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}, var_1_8={11:0}, var_1_8_Pointer={11:0}, var_1_9={12:0}, var_1_9_Pointer={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 10, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2124 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2124 mSDsluCounter, 9193 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7637 mSDsCounter, 250 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2861 IncrementalHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 250 mSolverCounterUnsat, 1556 mSDtfsCounter, 2861 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 688 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=300occurred in iteration=9, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 316 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 2214 NumberOfCodeBlocks, 2214 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2202 ConstructedInterpolants, 4 QuantifiedInterpolants, 12001 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1610 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 12507/13248 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:39:33,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-38.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 9436ed57987819903fc9546060edbc7fab121244510e369d708bc399b5aeace7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:39:35,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:39:35,903 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:39:35,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:39:35,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:39:35,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:39:35,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:39:35,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:39:35,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:39:35,938 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:39:35,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:39:35,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:39:35,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:39:35,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:39:35,938 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:39:35,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:39:35,939 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:39:35,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:39:35,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:39:35,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:39:35,940 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:39:35,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:39:35,940 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:39:35,940 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:35,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:39:35,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:39:35,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:39:35,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:39:35,940 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 -> 9436ed57987819903fc9546060edbc7fab121244510e369d708bc399b5aeace7 [2025-02-06 03:39:36,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:39:36,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:39:36,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:39:36,189 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:39:36,189 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:39:36,190 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-38.i [2025-02-06 03:39:37,452 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bbb261e28/b288f937c90d40969cfe9995f44daef4/FLAG04ce26749 [2025-02-06 03:39:37,655 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:39:37,655 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-38.i [2025-02-06 03:39:37,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bbb261e28/b288f937c90d40969cfe9995f44daef4/FLAG04ce26749 [2025-02-06 03:39:37,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bbb261e28/b288f937c90d40969cfe9995f44daef4 [2025-02-06 03:39:37,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:39:37,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:39:37,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:39:37,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:39:37,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:39:37,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:39:37" (1/1) ... [2025-02-06 03:39:37,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4170ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:37, skipping insertion in model container [2025-02-06 03:39:37,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:39:37" (1/1) ... [2025-02-06 03:39:37,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:39:37,821 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-38.i[916,929] [2025-02-06 03:39:37,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:39:37,887 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:39:37,896 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-38.i[916,929] [2025-02-06 03:39:37,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:39:37,943 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:39:37,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:37 WrapperNode [2025-02-06 03:39:37,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:39:37,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:39:37,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:39:37,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:39:37,949 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:39:37" (1/1) ... [2025-02-06 03:39:37,959 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:39:37" (1/1) ... [2025-02-06 03:39:37,998 INFO L138 Inliner]: procedures = 36, calls = 195, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 545 [2025-02-06 03:39:38,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:39:38,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:39:38,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:39:38,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:39:38,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:37" (1/1) ... [2025-02-06 03:39:38,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:37" (1/1) ... [2025-02-06 03:39:38,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:37" (1/1) ... [2025-02-06 03:39:38,052 INFO L175 MemorySlicer]: Split 141 memory accesses to 20 slices as follows [2, 3, 12, 14, 8, 3, 6, 3, 8, 8, 8, 8, 7, 10, 12, 8, 6, 3, 6, 6]. 10 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 21 writes are split as follows [0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1]. [2025-02-06 03:39:38,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:37" (1/1) ... [2025-02-06 03:39:38,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:37" (1/1) ... [2025-02-06 03:39:38,082 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:37" (1/1) ... [2025-02-06 03:39:38,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:37" (1/1) ... [2025-02-06 03:39:38,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:37" (1/1) ... [2025-02-06 03:39:38,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:37" (1/1) ... [2025-02-06 03:39:38,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:39:38,112 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:39:38,112 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:39:38,112 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:39:38,113 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:37" (1/1) ... [2025-02-06 03:39:38,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:39:38,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:39:38,138 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:39:38,140 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:39:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:39:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 03:39:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 03:39:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-02-06 03:39:38,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-02-06 03:39:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-02-06 03:39:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-02-06 03:39:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-02-06 03:39:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-02-06 03:39:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-02-06 03:39:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-02-06 03:39:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-02-06 03:39:38,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2025-02-06 03:39:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2025-02-06 03:39:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2025-02-06 03:39:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2025-02-06 03:39:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#15 [2025-02-06 03:39:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#16 [2025-02-06 03:39:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#17 [2025-02-06 03:39:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#18 [2025-02-06 03:39:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#19 [2025-02-06 03:39:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 03:39:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 03:39:38,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-02-06 03:39:38,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-02-06 03:39:38,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-02-06 03:39:38,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-02-06 03:39:38,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-02-06 03:39:38,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-02-06 03:39:38,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-02-06 03:39:38,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-02-06 03:39:38,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-02-06 03:39:38,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2025-02-06 03:39:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2025-02-06 03:39:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2025-02-06 03:39:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2025-02-06 03:39:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#15 [2025-02-06 03:39:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#16 [2025-02-06 03:39:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#17 [2025-02-06 03:39:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#18 [2025-02-06 03:39:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#19 [2025-02-06 03:39:38,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#17 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#18 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#19 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2025-02-06 03:39:38,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#16 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#17 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#18 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#19 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#17 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#18 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#19 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-02-06 03:39:38,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-02-06 03:39:38,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-02-06 03:39:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-02-06 03:39:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-02-06 03:39:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-02-06 03:39:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-02-06 03:39:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-02-06 03:39:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2025-02-06 03:39:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#16 [2025-02-06 03:39:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#17 [2025-02-06 03:39:38,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#18 [2025-02-06 03:39:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#19 [2025-02-06 03:39:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 03:39:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 03:39:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-02-06 03:39:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-02-06 03:39:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-02-06 03:39:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-02-06 03:39:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-02-06 03:39:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-02-06 03:39:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-02-06 03:39:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-02-06 03:39:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-02-06 03:39:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2025-02-06 03:39:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2025-02-06 03:39:38,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2025-02-06 03:39:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2025-02-06 03:39:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#15 [2025-02-06 03:39:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#16 [2025-02-06 03:39:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#17 [2025-02-06 03:39:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#18 [2025-02-06 03:39:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#19 [2025-02-06 03:39:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:39:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#17 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#18 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#19 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#16 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#17 [2025-02-06 03:39:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#18 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#19 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:39:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:39:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#17 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#18 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#19 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:39:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-02-06 03:39:38,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-02-06 03:39:38,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-02-06 03:39:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-02-06 03:39:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-02-06 03:39:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-02-06 03:39:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-02-06 03:39:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2025-02-06 03:39:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2025-02-06 03:39:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2025-02-06 03:39:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#16 [2025-02-06 03:39:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#17 [2025-02-06 03:39:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#18 [2025-02-06 03:39:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#19 [2025-02-06 03:39:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:39:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:39:38,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#17 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#18 [2025-02-06 03:39:38,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#19 [2025-02-06 03:39:38,428 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:39:38,429 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:39:42,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc property_#t~mem103#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite110#1;havoc property_#t~mem109#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~short111#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short117#1;havoc property_#t~mem118#1;havoc property_#t~ite132#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~ite131#1;havoc property_#t~mem128#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite127#1;havoc property_#t~mem126#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short133#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short136#1;havoc property_#t~mem137#1;havoc property_#t~short138#1;havoc property_#t~ite142#1;havoc property_#t~mem141#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~short143#1; [2025-02-06 03:39:42,948 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2025-02-06 03:39:42,948 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:39:42,962 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:39:42,963 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:39:42,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:42 BoogieIcfgContainer [2025-02-06 03:39:42,963 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:39:42,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:39:42,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:39:42,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:39:42,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:39:37" (1/3) ... [2025-02-06 03:39:42,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392db0c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:39:42, skipping insertion in model container [2025-02-06 03:39:42,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:39:37" (2/3) ... [2025-02-06 03:39:42,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392db0c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:39:42, skipping insertion in model container [2025-02-06 03:39:42,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:39:42" (3/3) ... [2025-02-06 03:39:42,977 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-38.i [2025-02-06 03:39:43,000 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:39:43,005 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-38.i that has 2 procedures, 121 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:39:43,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:39:43,084 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;@63e9fbbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:39:43,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:39:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:39:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:39:43,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:43,096 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:43,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:43,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:43,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1489406202, now seen corresponding path program 1 times [2025-02-06 03:39:43,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:43,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255919364] [2025-02-06 03:39:43,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:43,107 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:39:43,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:43,109 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:39:43,111 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:39:43,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:39:43,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:39:43,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:43,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:43,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:39:43,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2025-02-06 03:39:43,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:43,868 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:43,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255919364] [2025-02-06 03:39:43,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255919364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:43,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:39:43,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:39:43,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785907622] [2025-02-06 03:39:43,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:43,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:39:43,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:43,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:39:43,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:39:43,896 INFO L87 Difference]: Start difference. First operand has 121 states, 94 states have (on average 1.372340425531915) internal successors, (129), 95 states have internal predecessors, (129), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 03:39:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:43,921 INFO L93 Difference]: Finished difference Result 236 states and 373 transitions. [2025-02-06 03:39:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:39:43,922 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2025-02-06 03:39:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:43,930 INFO L225 Difference]: With dead ends: 236 [2025-02-06 03:39:43,930 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 03:39:43,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 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:39:43,934 INFO L435 NwaCegarLoop]: 172 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, 172 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:39:43,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:39:43,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 03:39:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-06 03:39:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:39:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2025-02-06 03:39:43,972 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 184 [2025-02-06 03:39:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:43,972 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2025-02-06 03:39:43,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 03:39:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2025-02-06 03:39:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:39:43,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:43,975 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:43,994 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:39:44,179 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:39:44,179 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:44,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1852933594, now seen corresponding path program 1 times [2025-02-06 03:39:44,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:44,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471313647] [2025-02-06 03:39:44,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:44,181 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:39:44,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:44,183 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:39:44,185 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:39:44,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:39:44,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:39:44,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:44,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:44,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 03:39:44,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:47,704 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 18 treesize of output 10 [2025-02-06 03:39:47,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-02-06 03:39:47,998 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 18 treesize of output 10 [2025-02-06 03:39:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 467 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2025-02-06 03:39:48,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:49,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:39:49,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2025-02-06 03:39:49,286 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:49,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471313647] [2025-02-06 03:39:49,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471313647] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:49,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [439194306] [2025-02-06 03:39:49,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:49,287 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:49,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:39:49,304 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:39:49,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-02-06 03:39:49,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:39:49,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:39:49,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:49,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:49,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:39:49,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 03:39:50,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:50,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [439194306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:50,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:50,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [20] total 23 [2025-02-06 03:39:50,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413318577] [2025-02-06 03:39:50,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:50,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:39:50,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:50,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:39:50,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:39:50,136 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:39:52,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:39:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:39:52,831 INFO L93 Difference]: Finished difference Result 236 states and 345 transitions. [2025-02-06 03:39:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:39:52,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2025-02-06 03:39:52,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:39:52,833 INFO L225 Difference]: With dead ends: 236 [2025-02-06 03:39:52,833 INFO L226 Difference]: Without dead ends: 121 [2025-02-06 03:39:52,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2025-02-06 03:39:52,834 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:39:52,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-06 03:39:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-06 03:39:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-02-06 03:39:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 94 states have internal predecessors, (126), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 03:39:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2025-02-06 03:39:52,842 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 184 [2025-02-06 03:39:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:39:52,843 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2025-02-06 03:39:52,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:39:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2025-02-06 03:39:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:39:52,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:39:52,845 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:52,866 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:39:53,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-02-06 03:39:53,249 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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:53,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:39:53,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:39:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash 45479131, now seen corresponding path program 1 times [2025-02-06 03:39:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:39:53,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009644818] [2025-02-06 03:39:53,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:53,251 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:39:53,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:39:53,252 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:39:53,254 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:39:53,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:39:53,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:39:53,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:53,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:53,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 03:39:53,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:56,793 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 18 treesize of output 10 [2025-02-06 03:39:57,014 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 18 treesize of output 10 [2025-02-06 03:39:57,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-02-06 03:39:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 467 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2025-02-06 03:39:57,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:39:58,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:39:58,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2025-02-06 03:39:58,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:39:58,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009644818] [2025-02-06 03:39:58,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009644818] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:39:58,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [363922722] [2025-02-06 03:39:58,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:39:58,564 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:39:58,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:39:58,566 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:39:58,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-02-06 03:39:58,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:39:59,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:39:59,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:39:59,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:39:59,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:39:59,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:39:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 03:39:59,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:39:59,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [363922722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:39:59,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:39:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 24 [2025-02-06 03:39:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235330232] [2025-02-06 03:39:59,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:39:59,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:39:59,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:39:59,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:39:59,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-02-06 03:39:59,289 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:40:00,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 03:40:00,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:00,709 INFO L93 Difference]: Finished difference Result 322 states and 468 transitions. [2025-02-06 03:40:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:40:00,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2025-02-06 03:40:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:00,711 INFO L225 Difference]: With dead ends: 322 [2025-02-06 03:40:00,711 INFO L226 Difference]: Without dead ends: 205 [2025-02-06 03:40:00,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 03:40:00,712 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 119 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:00,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 616 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 03:40:00,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-02-06 03:40:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2025-02-06 03:40:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 163 states have (on average 1.3496932515337423) internal successors, (220), 164 states have internal predecessors, (220), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:40:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 292 transitions. [2025-02-06 03:40:00,743 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 292 transitions. Word has length 184 [2025-02-06 03:40:00,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:00,743 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 292 transitions. [2025-02-06 03:40:00,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:40:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 292 transitions. [2025-02-06 03:40:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:40:00,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:00,745 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:00,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-02-06 03:40:00,968 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:40:01,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:40:01,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:01,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:01,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1042496763, now seen corresponding path program 1 times [2025-02-06 03:40:01,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:01,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74853980] [2025-02-06 03:40:01,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:01,158 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:40:01,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:01,161 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:40:01,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 03:40:01,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:40:01,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:40:01,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:01,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:01,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 03:40:01,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:03,613 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 18 treesize of output 10 [2025-02-06 03:40:03,773 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 18 treesize of output 10 [2025-02-06 03:40:03,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-02-06 03:40:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 467 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2025-02-06 03:40:03,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:04,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:40:04,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2025-02-06 03:40:04,849 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:04,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74853980] [2025-02-06 03:40:04,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74853980] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:04,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [856317192] [2025-02-06 03:40:04,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:04,849 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:40:04,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:40:04,851 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:40:04,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-02-06 03:40:05,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:40:06,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:40:06,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:06,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:06,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 03:40:06,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:06,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-06 03:40:07,302 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:40:10,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-06 03:40:10,349 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 18 treesize of output 10 [2025-02-06 03:40:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 22 proven. 446 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2025-02-06 03:40:10,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:11,031 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 46 treesize of output 42 [2025-02-06 03:40:11,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [856317192] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:11,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:40:11,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 32 [2025-02-06 03:40:11,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387041696] [2025-02-06 03:40:11,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:40:11,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 03:40:11,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:11,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 03:40:11,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1838, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 03:40:11,696 INFO L87 Difference]: Start difference. First operand 202 states and 292 transitions. Second operand has 33 states, 28 states have (on average 4.964285714285714) internal successors, (139), 27 states have internal predecessors, (139), 10 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 5 states have call predecessors, (48), 10 states have call successors, (48) [2025-02-06 03:40:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:16,708 INFO L93 Difference]: Finished difference Result 509 states and 714 transitions. [2025-02-06 03:40:16,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 03:40:16,708 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 4.964285714285714) internal successors, (139), 27 states have internal predecessors, (139), 10 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 5 states have call predecessors, (48), 10 states have call successors, (48) Word has length 184 [2025-02-06 03:40:16,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:16,711 INFO L225 Difference]: With dead ends: 509 [2025-02-06 03:40:16,711 INFO L226 Difference]: Without dead ends: 310 [2025-02-06 03:40:16,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=835, Invalid=3995, Unknown=0, NotChecked=0, Total=4830 [2025-02-06 03:40:16,713 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1208 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:16,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 2030 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-06 03:40:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-06 03:40:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 226. [2025-02-06 03:40:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 182 states have internal predecessors, (237), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:40:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 309 transitions. [2025-02-06 03:40:16,733 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 309 transitions. Word has length 184 [2025-02-06 03:40:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:16,734 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 309 transitions. [2025-02-06 03:40:16,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 4.964285714285714) internal successors, (139), 27 states have internal predecessors, (139), 10 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 5 states have call predecessors, (48), 10 states have call successors, (48) [2025-02-06 03:40:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 309 transitions. [2025-02-06 03:40:16,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:40:16,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:16,735 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:16,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 03:40:16,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2025-02-06 03:40:17,139 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,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:40:17,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:17,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:17,140 INFO L85 PathProgramCache]: Analyzing trace with hash 633672538, now seen corresponding path program 1 times [2025-02-06 03:40:17,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:17,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105843158] [2025-02-06 03:40:17,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:17,140 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:40:17,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:17,143 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:40:17,144 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:40:17,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:40:17,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:40:17,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:17,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:17,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:40:17,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:17,812 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 28 treesize of output 24 [2025-02-06 03:40:17,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2025-02-06 03:40:17,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2025-02-06 03:40:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2025-02-06 03:40:17,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 03:40:18,157 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:18,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105843158] [2025-02-06 03:40:18,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105843158] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:18,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:40:18,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-02-06 03:40:18,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305378952] [2025-02-06 03:40:18,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:18,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:40:18,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:18,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:40:18,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:40:18,158 INFO L87 Difference]: Start difference. First operand 226 states and 309 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:40:18,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:18,405 INFO L93 Difference]: Finished difference Result 531 states and 729 transitions. [2025-02-06 03:40:18,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:40:18,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2025-02-06 03:40:18,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:18,412 INFO L225 Difference]: With dead ends: 531 [2025-02-06 03:40:18,412 INFO L226 Difference]: Without dead ends: 308 [2025-02-06 03:40:18,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 355 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:40:18,414 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 54 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:18,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 960 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-06 03:40:18,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 248. [2025-02-06 03:40:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 203 states have (on average 1.3103448275862069) internal successors, (266), 204 states have internal predecessors, (266), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:40:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 338 transitions. [2025-02-06 03:40:18,443 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 338 transitions. Word has length 184 [2025-02-06 03:40:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:18,444 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 338 transitions. [2025-02-06 03:40:18,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:40:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 338 transitions. [2025-02-06 03:40:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:40:18,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:18,446 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:18,460 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:40:18,646 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:40:18,647 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:18,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:18,648 INFO L85 PathProgramCache]: Analyzing trace with hash 340269531, now seen corresponding path program 1 times [2025-02-06 03:40:18,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:18,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430225855] [2025-02-06 03:40:18,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:18,648 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:40:18,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:18,651 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:40:18,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-06 03:40:18,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:40:19,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:40:19,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:19,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:19,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:40:19,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:20,173 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 24 treesize of output 16 [2025-02-06 03:40:20,176 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 29 treesize of output 17 [2025-02-06 03:40:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 22 proven. 242 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:40:20,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 03:40:20,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430225855] [2025-02-06 03:40:20,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430225855] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:20,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:40:20,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-02-06 03:40:20,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599644055] [2025-02-06 03:40:20,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:20,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:40:20,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:20,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:40:20,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:40:20,461 INFO L87 Difference]: Start difference. First operand 248 states and 338 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:40:20,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:20,614 INFO L93 Difference]: Finished difference Result 545 states and 746 transitions. [2025-02-06 03:40:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:40:20,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2025-02-06 03:40:20,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:20,618 INFO L225 Difference]: With dead ends: 545 [2025-02-06 03:40:20,618 INFO L226 Difference]: Without dead ends: 300 [2025-02-06 03:40:20,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:40:20,620 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 50 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:20,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 677 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:20,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-02-06 03:40:20,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 248. [2025-02-06 03:40:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 203 states have (on average 1.3004926108374384) internal successors, (264), 204 states have internal predecessors, (264), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:40:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 336 transitions. [2025-02-06 03:40:20,643 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 336 transitions. Word has length 184 [2025-02-06 03:40:20,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:20,643 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 336 transitions. [2025-02-06 03:40:20,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:40:20,644 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 336 transitions. [2025-02-06 03:40:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:40:20,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:20,645 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:20,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2025-02-06 03:40:20,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:40:20,846 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:20,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:20,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1404383751, now seen corresponding path program 1 times [2025-02-06 03:40:20,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:20,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433360978] [2025-02-06 03:40:20,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:20,847 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:40:20,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:20,849 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:40:20,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-06 03:40:21,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:40:21,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:40:21,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:21,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:21,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:40:21,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:22,432 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 34 treesize of output 22 [2025-02-06 03:40:22,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-06 03:40:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 22 proven. 242 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-02-06 03:40:22,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:22,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 03:40:22,706 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:22,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433360978] [2025-02-06 03:40:22,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433360978] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:22,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:40:22,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-02-06 03:40:22,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575653792] [2025-02-06 03:40:22,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:22,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:40:22,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:22,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:40:22,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:40:22,707 INFO L87 Difference]: Start difference. First operand 248 states and 336 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:40:22,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:22,847 INFO L93 Difference]: Finished difference Result 545 states and 742 transitions. [2025-02-06 03:40:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:40:22,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2025-02-06 03:40:22,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:22,850 INFO L225 Difference]: With dead ends: 545 [2025-02-06 03:40:22,850 INFO L226 Difference]: Without dead ends: 300 [2025-02-06 03:40:22,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-02-06 03:40:22,851 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 98 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:22,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 514 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:40:22,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-02-06 03:40:22,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 248. [2025-02-06 03:40:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 203 states have (on average 1.29064039408867) internal successors, (262), 204 states have internal predecessors, (262), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:40:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 334 transitions. [2025-02-06 03:40:22,877 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 334 transitions. Word has length 184 [2025-02-06 03:40:22,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:22,878 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 334 transitions. [2025-02-06 03:40:22,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:40:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 334 transitions. [2025-02-06 03:40:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-06 03:40:22,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:22,879 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:22,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2025-02-06 03:40:23,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:40:23,080 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:23,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:23,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1697786758, now seen corresponding path program 1 times [2025-02-06 03:40:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:23,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797809645] [2025-02-06 03:40:23,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:23,081 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:40:23,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:23,083 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:40:23,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-02-06 03:40:23,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-06 03:40:23,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-06 03:40:23,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:23,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:23,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 03:40:23,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:23,806 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 28 treesize of output 24 [2025-02-06 03:40:23,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2025-02-06 03:40:23,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2025-02-06 03:40:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-02-06 03:40:23,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 03:40:24,261 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:24,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797809645] [2025-02-06 03:40:24,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797809645] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:24,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:40:24,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-02-06 03:40:24,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904996143] [2025-02-06 03:40:24,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:40:24,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:40:24,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:24,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:40:24,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:40:24,262 INFO L87 Difference]: Start difference. First operand 248 states and 334 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:40:24,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:24,712 INFO L93 Difference]: Finished difference Result 565 states and 758 transitions. [2025-02-06 03:40:24,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:40:24,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 184 [2025-02-06 03:40:24,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:24,714 INFO L225 Difference]: With dead ends: 565 [2025-02-06 03:40:24,714 INFO L226 Difference]: Without dead ends: 320 [2025-02-06 03:40:24,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 355 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:40:24,715 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 58 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:24,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1196 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:40:24,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-02-06 03:40:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 316. [2025-02-06 03:40:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 263 states have (on average 1.3003802281368821) internal successors, (342), 266 states have internal predecessors, (342), 40 states have call successors, (40), 12 states have call predecessors, (40), 12 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:40:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 422 transitions. [2025-02-06 03:40:24,739 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 422 transitions. Word has length 184 [2025-02-06 03:40:24,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:24,741 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 422 transitions. [2025-02-06 03:40:24,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 03:40:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 422 transitions. [2025-02-06 03:40:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-06 03:40:24,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:24,743 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:24,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-02-06 03:40:24,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 03:40:24,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:24,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:24,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2051787689, now seen corresponding path program 1 times [2025-02-06 03:40:24,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:24,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032104671] [2025-02-06 03:40:24,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:24,946 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:40:24,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:24,947 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:40:24,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-02-06 03:40:25,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-06 03:40:25,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-06 03:40:25,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:25,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:25,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 03:40:25,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:28,740 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 18 treesize of output 10 [2025-02-06 03:40:29,070 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 18 treesize of output 10 [2025-02-06 03:40:29,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-02-06 03:40:29,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 467 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2025-02-06 03:40:29,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:30,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:40:30,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2025-02-06 03:40:30,235 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:40:30,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032104671] [2025-02-06 03:40:30,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032104671] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:30,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1947383762] [2025-02-06 03:40:30,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:30,236 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 03:40:30,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 03:40:30,239 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 03:40:30,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2025-02-06 03:40:30,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-02-06 03:40:31,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-02-06 03:40:31,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:40:31,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:40:31,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 03:40:31,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:40:31,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-06 03:40:32,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-06 03:40:36,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-06 03:40:36,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-02-06 03:40:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 34 proven. 446 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2025-02-06 03:40:36,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:40:37,133 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 47 treesize of output 43 [2025-02-06 03:40:37,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1947383762] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:40:37,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:40:37,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 33 [2025-02-06 03:40:37,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353413453] [2025-02-06 03:40:37,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:40:37,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 03:40:37,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:40:37,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 03:40:37,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1922, Unknown=0, NotChecked=0, Total=2162 [2025-02-06 03:40:37,449 INFO L87 Difference]: Start difference. First operand 316 states and 422 transitions. Second operand has 34 states, 29 states have (on average 5.310344827586207) internal successors, (154), 28 states have internal predecessors, (154), 11 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 6 states have call predecessors, (48), 11 states have call successors, (48) [2025-02-06 03:40:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:40:41,956 INFO L93 Difference]: Finished difference Result 645 states and 854 transitions. [2025-02-06 03:40:41,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-06 03:40:41,960 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 5.310344827586207) internal successors, (154), 28 states have internal predecessors, (154), 11 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 6 states have call predecessors, (48), 11 states have call successors, (48) Word has length 186 [2025-02-06 03:40:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:40:41,964 INFO L225 Difference]: With dead ends: 645 [2025-02-06 03:40:41,964 INFO L226 Difference]: Without dead ends: 332 [2025-02-06 03:40:41,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=939, Invalid=4463, Unknown=0, NotChecked=0, Total=5402 [2025-02-06 03:40:41,967 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1246 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:40:41,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 2008 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 03:40:41,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-06 03:40:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 324. [2025-02-06 03:40:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 269 states have (on average 1.278810408921933) internal successors, (344), 272 states have internal predecessors, (344), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-06 03:40:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 424 transitions. [2025-02-06 03:40:41,994 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 424 transitions. Word has length 186 [2025-02-06 03:40:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:40:41,994 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 424 transitions. [2025-02-06 03:40:41,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 5.310344827586207) internal successors, (154), 28 states have internal predecessors, (154), 11 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 6 states have call predecessors, (48), 11 states have call successors, (48) [2025-02-06 03:40:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 424 transitions. [2025-02-06 03:40:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-02-06 03:40:41,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:40:41,997 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:42,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-02-06 03:40:42,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2025-02-06 03:40:42,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 03:40:42,401 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:40:42,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:40:42,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1922704970, now seen corresponding path program 1 times [2025-02-06 03:40:42,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:40:42,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645838349] [2025-02-06 03:40:42,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:40:42,402 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:40:42,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:40:42,405 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 03:40:42,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-02-06 03:40:42,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes.