./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 9c2d9fe6cca3f07b0ec4ef0cef7c77d56847aacde02fd15a5949ee3e6a04e48b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:48:44,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:48:45,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:48:45,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:48:45,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:48:45,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:48:45,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:48:45,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:48:45,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:48:45,029 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:48:45,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:48:45,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:48:45,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:48:45,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:48:45,030 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:48:45,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:48:45,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:48:45,030 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:48:45,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:48:45,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:48:45,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:48:45,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:48:45,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:48:45,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:48:45,031 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:48:45,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:48:45,032 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:48:45,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:48:45,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:48:45,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:48:45,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:48:45,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:48:45,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:48:45,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:48:45,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:48:45,033 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:48:45,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:48:45,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:48:45,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:48:45,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:48:45,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:48:45,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:48:45,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:48:45,034 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/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 -> 9c2d9fe6cca3f07b0ec4ef0cef7c77d56847aacde02fd15a5949ee3e6a04e48b [2025-03-17 05:48:45,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:48:45,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:48:45,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:48:45,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:48:45,274 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:48:45,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i [2025-03-17 05:48:46,363 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985972508/013c39023089492a97ce53dd24bf5976/FLAGa402ffe5f [2025-03-17 05:48:46,617 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:48:46,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i [2025-03-17 05:48:46,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985972508/013c39023089492a97ce53dd24bf5976/FLAGa402ffe5f [2025-03-17 05:48:46,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/985972508/013c39023089492a97ce53dd24bf5976 [2025-03-17 05:48:46,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:48:46,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:48:46,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:48:46,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:48:46,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:48:46,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:48:46" (1/1) ... [2025-03-17 05:48:46,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c851df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:46, skipping insertion in model container [2025-03-17 05:48:46,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:48:46" (1/1) ... [2025-03-17 05:48:46,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:48:46,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i[916,929] [2025-03-17 05:48:46,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:48:46,855 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:48:46,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i[916,929] [2025-03-17 05:48:46,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:48:46,916 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:48:46,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:46 WrapperNode [2025-03-17 05:48:46,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:48:46,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:48:46,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:48:46,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:48:46,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:46" (1/1) ... [2025-03-17 05:48:46,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:46" (1/1) ... [2025-03-17 05:48:46,960 INFO L138 Inliner]: procedures = 29, calls = 221, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 708 [2025-03-17 05:48:46,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:48:46,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:48:46,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:48:46,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:48:46,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:46" (1/1) ... [2025-03-17 05:48:46,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:46" (1/1) ... [2025-03-17 05:48:46,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:46" (1/1) ... [2025-03-17 05:48:47,000 INFO L175 MemorySlicer]: Split 174 memory accesses to 19 slices as follows [2, 3, 14, 12, 10, 8, 5, 8, 3, 6, 31, 10, 8, 6, 8, 8, 8, 19, 5]. 18 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-03-17 05:48:47,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:46" (1/1) ... [2025-03-17 05:48:47,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:46" (1/1) ... [2025-03-17 05:48:47,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:46" (1/1) ... [2025-03-17 05:48:47,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:46" (1/1) ... [2025-03-17 05:48:47,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:46" (1/1) ... [2025-03-17 05:48:47,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:46" (1/1) ... [2025-03-17 05:48:47,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:48:47,032 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:48:47,032 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:48:47,033 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:48:47,033 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:46" (1/1) ... [2025-03-17 05:48:47,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:48:47,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:48:47,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:48:47,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:48:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:48:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:48:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:48:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:48:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:48:47,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:48:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:48:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:48:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-17 05:48:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-17 05:48:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-17 05:48:47,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#17 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#18 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:48:47,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-03-17 05:48:47,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#17 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#18 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-17 05:48:47,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-17 05:48:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-17 05:48:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-17 05:48:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-03-17 05:48:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-03-17 05:48:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-03-17 05:48:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2025-03-17 05:48:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2025-03-17 05:48:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#17 [2025-03-17 05:48:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#18 [2025-03-17 05:48:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:48:47,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:48:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:48:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:48:47,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:48:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:48:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:48:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:48:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:48:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:48:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:48:47,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:48:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:48:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:48:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 05:48:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-17 05:48:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-17 05:48:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-17 05:48:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-17 05:48:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-17 05:48:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-17 05:48:47,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:48:47,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:48:47,283 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:48:47,285 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:48:47,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~mem117#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short124#1;havoc property_#t~mem133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite160#1;havoc property_#t~mem157#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite156#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1;havoc property_#t~mem170#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~ite169#1;havoc property_#t~mem167#1;havoc property_#t~mem168#1;havoc property_#t~ite183#1;havoc property_#t~mem182#1;havoc property_#t~mem171#1;havoc property_#t~mem172#1;havoc property_#t~ite175#1;havoc property_#t~mem173#1;havoc property_#t~mem174#1;havoc property_#t~mem176#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite181#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~short184#1;havoc property_#t~mem185#1;havoc property_#t~short186#1;havoc property_#t~mem188#1;havoc property_#t~mem187#1;havoc property_#t~short189#1;havoc property_#t~mem191#1;havoc property_#t~mem190#1;havoc property_#t~short192#1; [2025-03-17 05:48:47,783 INFO L? ?]: Removed 199 outVars from TransFormulas that were not future-live. [2025-03-17 05:48:47,784 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:48:47,794 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:48:47,795 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:48:47,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:48:47 BoogieIcfgContainer [2025-03-17 05:48:47,795 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:48:47,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:48:47,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:48:47,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:48:47,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:48:46" (1/3) ... [2025-03-17 05:48:47,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249bc77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:48:47, skipping insertion in model container [2025-03-17 05:48:47,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:48:46" (2/3) ... [2025-03-17 05:48:47,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249bc77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:48:47, skipping insertion in model container [2025-03-17 05:48:47,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:48:47" (3/3) ... [2025-03-17 05:48:47,802 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-63.i [2025-03-17 05:48:47,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:48:47,816 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-63.i that has 2 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:48:47,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:48:47,871 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;@41547791, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:48:47,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:48:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 113 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:48:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:48:47,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:47,887 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:47,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:47,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:47,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2121181810, now seen corresponding path program 1 times [2025-03-17 05:48:47,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:47,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286251751] [2025-03-17 05:48:47,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:47,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:48,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:48:48,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:48:48,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:48,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 05:48:48,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:48,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286251751] [2025-03-17 05:48:48,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286251751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:48,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853185952] [2025-03-17 05:48:48,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:48,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:48:48,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:48:48,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:48:48,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:48:48,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:48:48,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:48:48,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:48,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:48,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:48:48,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 05:48:48,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:48,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853185952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:48,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:48:48,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:48:48,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286990179] [2025-03-17 05:48:48,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:48,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:48:48,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:48,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:48:48,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:48:48,587 INFO L87 Difference]: Start difference. First operand has 133 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 113 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:48:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:48,612 INFO L93 Difference]: Finished difference Result 263 states and 412 transitions. [2025-03-17 05:48:48,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:48:48,614 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 152 [2025-03-17 05:48:48,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:48,620 INFO L225 Difference]: With dead ends: 263 [2025-03-17 05:48:48,621 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 05:48:48,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 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-03-17 05:48:48,627 INFO L435 NwaCegarLoop]: 194 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, 194 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-03-17 05:48:48,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 05:48:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-17 05:48:48,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 111 states have (on average 1.4234234234234233) internal successors, (158), 111 states have internal predecessors, (158), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:48:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 194 transitions. [2025-03-17 05:48:48,656 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 194 transitions. Word has length 152 [2025-03-17 05:48:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:48,656 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 194 transitions. [2025-03-17 05:48:48,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:48:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 194 transitions. [2025-03-17 05:48:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:48:48,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:48,661 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:48,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:48:48,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:48:48,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:48,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:48,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1975702652, now seen corresponding path program 1 times [2025-03-17 05:48:48,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:48,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303413710] [2025-03-17 05:48:48,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:48,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:48,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:48:48,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:48:48,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:48,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:48:49,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:49,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303413710] [2025-03-17 05:48:49,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303413710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:49,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:49,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:48:49,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408231454] [2025-03-17 05:48:49,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:49,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:48:49,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:49,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:48:49,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:48:49,183 INFO L87 Difference]: Start difference. First operand 131 states and 194 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:48:49,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:49,211 INFO L93 Difference]: Finished difference Result 263 states and 390 transitions. [2025-03-17 05:48:49,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:48:49,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 152 [2025-03-17 05:48:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:49,214 INFO L225 Difference]: With dead ends: 263 [2025-03-17 05:48:49,214 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 05:48:49,215 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-03-17 05:48:49,215 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:49,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:49,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 05:48:49,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-17 05:48:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 113 states have (on average 1.415929203539823) internal successors, (160), 113 states have internal predecessors, (160), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:48:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2025-03-17 05:48:49,232 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 152 [2025-03-17 05:48:49,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:49,233 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2025-03-17 05:48:49,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:48:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2025-03-17 05:48:49,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:48:49,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:49,235 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:49,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:48:49,235 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:49,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:49,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1152021181, now seen corresponding path program 1 times [2025-03-17 05:48:49,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:49,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720444813] [2025-03-17 05:48:49,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:49,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:49,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:48:49,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:48:49,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:49,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:49,533 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:48:49,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:49,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720444813] [2025-03-17 05:48:49,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720444813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:49,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645378230] [2025-03-17 05:48:49,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:49,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:48:49,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:48:49,539 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:48:49,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:48:49,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:48:49,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:48:49,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:49,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:49,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:48:49,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:48:49,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:49,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645378230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:49,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:48:49,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:48:49,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803890286] [2025-03-17 05:48:49,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:49,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:48:49,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:49,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:48:49,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:48:49,901 INFO L87 Difference]: Start difference. First operand 133 states and 196 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:49,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:49,943 INFO L93 Difference]: Finished difference Result 268 states and 395 transitions. [2025-03-17 05:48:49,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:48:49,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 05:48:49,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:49,947 INFO L225 Difference]: With dead ends: 268 [2025-03-17 05:48:49,948 INFO L226 Difference]: Without dead ends: 136 [2025-03-17 05:48:49,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:48:49,950 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 562 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-03-17 05:48:49,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 562 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:49,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-17 05:48:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2025-03-17 05:48:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:48:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-03-17 05:48:49,964 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 152 [2025-03-17 05:48:49,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:49,965 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-03-17 05:48:49,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-03-17 05:48:49,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:48:49,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:49,968 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:49,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:48:50,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-17 05:48:50,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:50,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:50,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1445424188, now seen corresponding path program 1 times [2025-03-17 05:48:50,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:50,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942941502] [2025-03-17 05:48:50,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:50,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:50,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:48:50,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:48:50,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:50,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:48:50,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:50,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942941502] [2025-03-17 05:48:50,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942941502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:50,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654816954] [2025-03-17 05:48:50,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:50,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:48:50,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:48:50,404 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:48:50,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:48:50,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:48:50,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:48:50,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:50,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:50,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:48:50,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:48:50,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:50,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654816954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:50,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:48:50,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:48:50,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483687530] [2025-03-17 05:48:50,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:50,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:48:50,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:50,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:48:50,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:48:50,747 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:50,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:50,782 INFO L93 Difference]: Finished difference Result 272 states and 399 transitions. [2025-03-17 05:48:50,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:48:50,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 05:48:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:50,784 INFO L225 Difference]: With dead ends: 272 [2025-03-17 05:48:50,784 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 05:48:50,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:48:50,793 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 562 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-03-17 05:48:50,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 562 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:50,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 05:48:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2025-03-17 05:48:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:48:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-03-17 05:48:50,806 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 152 [2025-03-17 05:48:50,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:50,807 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-03-17 05:48:50,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:50,808 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-03-17 05:48:50,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:48:50,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:50,809 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:50,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:48:51,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:48:51,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:51,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:51,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1042088645, now seen corresponding path program 1 times [2025-03-17 05:48:51,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:51,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474260035] [2025-03-17 05:48:51,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:51,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:51,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:48:51,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:48:51,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:51,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:48:51,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:51,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474260035] [2025-03-17 05:48:51,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474260035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:51,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205945085] [2025-03-17 05:48:51,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:51,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:48:51,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:48:51,219 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:48:51,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:48:51,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:48:51,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:48:51,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:51,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:51,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:48:51,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:48:51,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:51,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205945085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:51,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:48:51,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:48:51,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942618535] [2025-03-17 05:48:51,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:51,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:48:51,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:51,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:48:51,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:48:51,515 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:51,534 INFO L93 Difference]: Finished difference Result 276 states and 403 transitions. [2025-03-17 05:48:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:48:51,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 05:48:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:51,537 INFO L225 Difference]: With dead ends: 276 [2025-03-17 05:48:51,537 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 05:48:51,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:48:51,538 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:51,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 563 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 05:48:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-03-17 05:48:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:48:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2025-03-17 05:48:51,547 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 152 [2025-03-17 05:48:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:51,547 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2025-03-17 05:48:51,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2025-03-17 05:48:51,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:48:51,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:51,552 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:51,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:48:51,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:48:51,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:51,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1929592326, now seen corresponding path program 1 times [2025-03-17 05:48:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:51,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995143053] [2025-03-17 05:48:51,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:51,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:51,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:48:51,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:48:51,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:51,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:48:51,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:51,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995143053] [2025-03-17 05:48:51,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995143053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:51,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688284517] [2025-03-17 05:48:51,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:51,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:48:51,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:48:51,941 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:48:51,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:48:52,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:48:52,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:48:52,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:52,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:52,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:48:52,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:48:52,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:52,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688284517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:52,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:48:52,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 05:48:52,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332422412] [2025-03-17 05:48:52,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:52,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:48:52,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:52,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:48:52,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:48:52,231 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:52,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:52,253 INFO L93 Difference]: Finished difference Result 280 states and 407 transitions. [2025-03-17 05:48:52,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:48:52,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 05:48:52,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:52,255 INFO L225 Difference]: With dead ends: 280 [2025-03-17 05:48:52,255 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 05:48:52,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:48:52,256 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:52,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 565 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:52,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 05:48:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-03-17 05:48:52,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:48:52,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-03-17 05:48:52,267 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 152 [2025-03-17 05:48:52,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:52,268 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-03-17 05:48:52,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-03-17 05:48:52,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:48:52,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:52,269 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:52,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 05:48:52,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:48:52,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:52,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1930515847, now seen corresponding path program 1 times [2025-03-17 05:48:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:52,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453398299] [2025-03-17 05:48:52,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:52,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:52,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:48:52,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:48:52,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:52,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:48:52,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:52,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453398299] [2025-03-17 05:48:52,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453398299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:52,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387642168] [2025-03-17 05:48:52,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:52,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:48:52,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:48:52,638 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:48:52,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 05:48:52,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:48:52,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:48:52,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:52,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:52,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:48:52,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:52,910 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:48:52,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:52,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387642168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:52,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:48:52,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:48:52,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827786435] [2025-03-17 05:48:52,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:52,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:48:52,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:52,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:48:52,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:48:52,913 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:52,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:52,934 INFO L93 Difference]: Finished difference Result 283 states and 410 transitions. [2025-03-17 05:48:52,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:48:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 05:48:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:52,936 INFO L225 Difference]: With dead ends: 283 [2025-03-17 05:48:52,937 INFO L226 Difference]: Without dead ends: 143 [2025-03-17 05:48:52,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:48:52,938 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:52,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:52,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-17 05:48:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-17 05:48:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:48:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2025-03-17 05:48:52,947 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 152 [2025-03-17 05:48:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:52,948 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2025-03-17 05:48:52,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:52,948 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2025-03-17 05:48:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:48:52,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:52,950 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:52,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 05:48:53,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:48:53,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:53,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:53,151 INFO L85 PathProgramCache]: Analyzing trace with hash 510858629, now seen corresponding path program 1 times [2025-03-17 05:48:53,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:53,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485747808] [2025-03-17 05:48:53,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:53,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:53,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:48:53,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:48:53,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:53,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:53,751 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:48:53,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:53,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485747808] [2025-03-17 05:48:53,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485747808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:53,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173454679] [2025-03-17 05:48:53,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:53,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:48:53,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:48:53,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:48:53,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 05:48:53,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:48:54,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:48:54,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:54,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:54,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:48:54,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:54,146 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-03-17 05:48:54,315 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 11 [2025-03-17 05:48:54,409 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 37 treesize of output 25 [2025-03-17 05:48:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:48:54,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:48:54,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-03-17 05:48:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:48:54,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173454679] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:48:54,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:48:54,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 16 [2025-03-17 05:48:54,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293729592] [2025-03-17 05:48:54,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:48:54,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:48:54,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:54,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:48:54,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:48:54,737 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 16 states have internal predecessors, (99), 6 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (37), 4 states have call predecessors, (37), 6 states have call successors, (37) [2025-03-17 05:48:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:55,152 INFO L93 Difference]: Finished difference Result 297 states and 421 transitions. [2025-03-17 05:48:55,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:48:55,152 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 16 states have internal predecessors, (99), 6 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (37), 4 states have call predecessors, (37), 6 states have call successors, (37) Word has length 154 [2025-03-17 05:48:55,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:55,153 INFO L225 Difference]: With dead ends: 297 [2025-03-17 05:48:55,153 INFO L226 Difference]: Without dead ends: 155 [2025-03-17 05:48:55,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 303 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2025-03-17 05:48:55,155 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 909 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:55,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 786 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:48:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-17 05:48:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2025-03-17 05:48:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.3565891472868217) internal successors, (175), 129 states have internal predecessors, (175), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:48:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 211 transitions. [2025-03-17 05:48:55,161 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 211 transitions. Word has length 154 [2025-03-17 05:48:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:55,162 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 211 transitions. [2025-03-17 05:48:55,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.071428571428571) internal successors, (99), 16 states have internal predecessors, (99), 6 states have call successors, (37), 3 states have call predecessors, (37), 5 states have return successors, (37), 4 states have call predecessors, (37), 6 states have call successors, (37) [2025-03-17 05:48:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 211 transitions. [2025-03-17 05:48:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:48:55,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:55,163 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:55,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 05:48:55,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:48:55,368 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:55,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:55,368 INFO L85 PathProgramCache]: Analyzing trace with hash -486213724, now seen corresponding path program 1 times [2025-03-17 05:48:55,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:55,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812630491] [2025-03-17 05:48:55,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:55,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:55,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:48:55,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:48:55,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:55,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:48:55,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:55,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812630491] [2025-03-17 05:48:55,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812630491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:55,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:55,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:48:55,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884543229] [2025-03-17 05:48:55,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:55,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:48:55,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:55,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:48:55,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:48:55,716 INFO L87 Difference]: Start difference. First operand 151 states and 211 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:55,778 INFO L93 Difference]: Finished difference Result 449 states and 629 transitions. [2025-03-17 05:48:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:48:55,779 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 154 [2025-03-17 05:48:55,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:55,780 INFO L225 Difference]: With dead ends: 449 [2025-03-17 05:48:55,780 INFO L226 Difference]: Without dead ends: 299 [2025-03-17 05:48:55,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:48:55,781 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 128 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:55,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1044 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-17 05:48:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 293. [2025-03-17 05:48:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 250 states have (on average 1.36) internal successors, (340), 250 states have internal predecessors, (340), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:48:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 412 transitions. [2025-03-17 05:48:55,795 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 412 transitions. Word has length 154 [2025-03-17 05:48:55,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:55,796 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 412 transitions. [2025-03-17 05:48:55,796 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 412 transitions. [2025-03-17 05:48:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:48:55,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:55,797 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:55,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:48:55,797 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:55,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:55,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1591582042, now seen corresponding path program 1 times [2025-03-17 05:48:55,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:55,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629434030] [2025-03-17 05:48:55,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:55,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:55,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:48:55,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:48:55,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:55,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:48:56,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:56,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629434030] [2025-03-17 05:48:56,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629434030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:56,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:56,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:48:56,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829106925] [2025-03-17 05:48:56,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:56,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:48:56,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:56,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:48:56,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:48:56,042 INFO L87 Difference]: Start difference. First operand 293 states and 412 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:56,103 INFO L93 Difference]: Finished difference Result 584 states and 819 transitions. [2025-03-17 05:48:56,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:48:56,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-17 05:48:56,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:56,106 INFO L225 Difference]: With dead ends: 584 [2025-03-17 05:48:56,106 INFO L226 Difference]: Without dead ends: 433 [2025-03-17 05:48:56,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:48:56,107 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 171 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:56,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1098 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-17 05:48:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 318. [2025-03-17 05:48:56,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 275 states have (on average 1.3709090909090909) internal successors, (377), 275 states have internal predecessors, (377), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:48:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 449 transitions. [2025-03-17 05:48:56,140 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 449 transitions. Word has length 156 [2025-03-17 05:48:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:56,141 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 449 transitions. [2025-03-17 05:48:56,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 449 transitions. [2025-03-17 05:48:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:48:56,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:56,142 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:56,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:48:56,143 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:56,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:56,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1240782105, now seen corresponding path program 1 times [2025-03-17 05:48:56,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:56,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533091651] [2025-03-17 05:48:56,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:56,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:56,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:48:56,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:48:56,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:56,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:48:56,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:56,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533091651] [2025-03-17 05:48:56,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533091651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:56,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:56,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:48:56,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502480734] [2025-03-17 05:48:56,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:56,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:48:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:56,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:48:56,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:48:56,633 INFO L87 Difference]: Start difference. First operand 318 states and 449 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:56,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:56,738 INFO L93 Difference]: Finished difference Result 642 states and 905 transitions. [2025-03-17 05:48:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:48:56,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-17 05:48:56,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:56,742 INFO L225 Difference]: With dead ends: 642 [2025-03-17 05:48:56,742 INFO L226 Difference]: Without dead ends: 467 [2025-03-17 05:48:56,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:48:56,744 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 180 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:56,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 1289 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-17 05:48:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 318. [2025-03-17 05:48:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 275 states have (on average 1.3709090909090909) internal successors, (377), 275 states have internal predecessors, (377), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:48:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 449 transitions. [2025-03-17 05:48:56,767 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 449 transitions. Word has length 156 [2025-03-17 05:48:56,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:56,767 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 449 transitions. [2025-03-17 05:48:56,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 449 transitions. [2025-03-17 05:48:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:48:56,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:56,768 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:56,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:48:56,768 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:56,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash 68215156, now seen corresponding path program 1 times [2025-03-17 05:48:56,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:56,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143135077] [2025-03-17 05:48:56,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:56,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:56,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:48:56,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:48:56,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:56,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:57,237 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:48:57,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:57,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143135077] [2025-03-17 05:48:57,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143135077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:57,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:57,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:48:57,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203409522] [2025-03-17 05:48:57,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:57,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:48:57,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:57,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:48:57,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:48:57,239 INFO L87 Difference]: Start difference. First operand 318 states and 449 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:48:57,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:57,409 INFO L93 Difference]: Finished difference Result 690 states and 968 transitions. [2025-03-17 05:48:57,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:48:57,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 156 [2025-03-17 05:48:57,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:57,412 INFO L225 Difference]: With dead ends: 690 [2025-03-17 05:48:57,412 INFO L226 Difference]: Without dead ends: 373 [2025-03-17 05:48:57,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:48:57,414 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 293 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:57,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 945 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:48:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-17 05:48:57,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 372. [2025-03-17 05:48:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 319 states have (on average 1.3573667711598747) internal successors, (433), 320 states have internal predecessors, (433), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:48:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 517 transitions. [2025-03-17 05:48:57,446 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 517 transitions. Word has length 156 [2025-03-17 05:48:57,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:57,446 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 517 transitions. [2025-03-17 05:48:57,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:48:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 517 transitions. [2025-03-17 05:48:57,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:48:57,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:57,449 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:57,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:48:57,449 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:57,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:57,449 INFO L85 PathProgramCache]: Analyzing trace with hash -225187851, now seen corresponding path program 1 times [2025-03-17 05:48:57,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:57,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447248055] [2025-03-17 05:48:57,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:57,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:57,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:48:57,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:48:57,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:57,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:48:57,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:57,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447248055] [2025-03-17 05:48:57,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447248055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:57,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:57,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:48:57,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664600203] [2025-03-17 05:48:57,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:57,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:48:57,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:57,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:48:57,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:48:57,682 INFO L87 Difference]: Start difference. First operand 372 states and 517 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:57,786 INFO L93 Difference]: Finished difference Result 967 states and 1334 transitions. [2025-03-17 05:48:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:48:57,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-17 05:48:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:57,790 INFO L225 Difference]: With dead ends: 967 [2025-03-17 05:48:57,791 INFO L226 Difference]: Without dead ends: 638 [2025-03-17 05:48:57,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:48:57,793 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 147 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:57,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1251 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:48:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-17 05:48:57,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 519. [2025-03-17 05:48:57,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 444 states have (on average 1.34009009009009) internal successors, (595), 446 states have internal predecessors, (595), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:48:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 715 transitions. [2025-03-17 05:48:57,830 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 715 transitions. Word has length 156 [2025-03-17 05:48:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:57,830 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 715 transitions. [2025-03-17 05:48:57,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 715 transitions. [2025-03-17 05:48:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 05:48:57,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:57,831 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:57,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:48:57,832 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:57,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:57,832 INFO L85 PathProgramCache]: Analyzing trace with hash -669412172, now seen corresponding path program 1 times [2025-03-17 05:48:57,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:57,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204804170] [2025-03-17 05:48:57,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:57,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:57,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 05:48:57,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 05:48:57,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:57,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:48:58,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:58,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204804170] [2025-03-17 05:48:58,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204804170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:58,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:58,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:48:58,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644565959] [2025-03-17 05:48:58,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:58,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:48:58,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:58,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:48:58,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:48:58,447 INFO L87 Difference]: Start difference. First operand 519 states and 715 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 9 states have internal predecessors, (72), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:48:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:58,658 INFO L93 Difference]: Finished difference Result 530 states and 728 transitions. [2025-03-17 05:48:58,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:48:58,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 9 states have internal predecessors, (72), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 159 [2025-03-17 05:48:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:58,662 INFO L225 Difference]: With dead ends: 530 [2025-03-17 05:48:58,662 INFO L226 Difference]: Without dead ends: 528 [2025-03-17 05:48:58,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:48:58,663 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 282 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:58,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 890 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:48:58,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-17 05:48:58,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-03-17 05:48:58,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 453 states have (on average 1.3333333333333333) internal successors, (604), 455 states have internal predecessors, (604), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:48:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 724 transitions. [2025-03-17 05:48:58,701 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 724 transitions. Word has length 159 [2025-03-17 05:48:58,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:58,701 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 724 transitions. [2025-03-17 05:48:58,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 9 states have internal predecessors, (72), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:48:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 724 transitions. [2025-03-17 05:48:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 05:48:58,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:58,704 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:58,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:48:58,704 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:58,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:58,704 INFO L85 PathProgramCache]: Analyzing trace with hash -668488651, now seen corresponding path program 1 times [2025-03-17 05:48:58,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:58,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991003079] [2025-03-17 05:48:58,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:58,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:58,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 05:48:58,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 05:48:58,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:58,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:48:58,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:58,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991003079] [2025-03-17 05:48:58,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991003079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:58,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:58,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:48:58,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189961313] [2025-03-17 05:48:58,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:58,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:48:58,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:58,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:48:58,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:48:58,888 INFO L87 Difference]: Start difference. First operand 528 states and 724 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:58,983 INFO L93 Difference]: Finished difference Result 1025 states and 1398 transitions. [2025-03-17 05:48:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:48:58,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 159 [2025-03-17 05:48:58,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:58,986 INFO L225 Difference]: With dead ends: 1025 [2025-03-17 05:48:58,986 INFO L226 Difference]: Without dead ends: 540 [2025-03-17 05:48:58,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:48:58,987 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 132 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:58,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 535 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:58,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-17 05:48:59,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 516. [2025-03-17 05:48:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 449 states have (on average 1.329621380846325) internal successors, (597), 451 states have internal predecessors, (597), 50 states have call successors, (50), 16 states have call predecessors, (50), 16 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 05:48:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 697 transitions. [2025-03-17 05:48:59,018 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 697 transitions. Word has length 159 [2025-03-17 05:48:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:59,018 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 697 transitions. [2025-03-17 05:48:59,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 697 transitions. [2025-03-17 05:48:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 05:48:59,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:59,020 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:59,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:48:59,020 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:59,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:59,020 INFO L85 PathProgramCache]: Analyzing trace with hash 219015030, now seen corresponding path program 1 times [2025-03-17 05:48:59,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:59,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255701838] [2025-03-17 05:48:59,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:59,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:59,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 05:48:59,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 05:48:59,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:59,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:48:59,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:59,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255701838] [2025-03-17 05:48:59,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255701838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:59,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:59,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:48:59,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805030458] [2025-03-17 05:48:59,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:59,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:48:59,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:59,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:48:59,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:48:59,184 INFO L87 Difference]: Start difference. First operand 516 states and 697 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:59,247 INFO L93 Difference]: Finished difference Result 989 states and 1335 transitions. [2025-03-17 05:48:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:48:59,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 159 [2025-03-17 05:48:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:59,249 INFO L225 Difference]: With dead ends: 989 [2025-03-17 05:48:59,249 INFO L226 Difference]: Without dead ends: 516 [2025-03-17 05:48:59,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:48:59,250 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 75 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:59,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 633 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-17 05:48:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-17 05:48:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 449 states have (on average 1.3229398663697105) internal successors, (594), 451 states have internal predecessors, (594), 50 states have call successors, (50), 16 states have call predecessors, (50), 16 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 05:48:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 694 transitions. [2025-03-17 05:48:59,281 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 694 transitions. Word has length 159 [2025-03-17 05:48:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:59,281 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 694 transitions. [2025-03-17 05:48:59,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 694 transitions. [2025-03-17 05:48:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 05:48:59,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:59,282 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:59,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:48:59,283 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:59,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:59,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1588439433, now seen corresponding path program 1 times [2025-03-17 05:48:59,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:48:59,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602840510] [2025-03-17 05:48:59,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:59,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:48:59,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 05:48:59,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 05:48:59,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:59,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:48:59,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:48:59,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602840510] [2025-03-17 05:48:59,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602840510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:59,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194551561] [2025-03-17 05:48:59,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:59,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:48:59,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:48:59,445 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:48:59,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 05:48:59,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 05:48:59,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 05:48:59,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:59,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:59,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:48:59,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:48:59,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:59,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194551561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:59,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:48:59,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:48:59,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138641722] [2025-03-17 05:48:59,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:59,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:48:59,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:48:59,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:48:59,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:48:59,735 INFO L87 Difference]: Start difference. First operand 516 states and 694 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:59,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:59,778 INFO L93 Difference]: Finished difference Result 998 states and 1341 transitions. [2025-03-17 05:48:59,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:48:59,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 159 [2025-03-17 05:48:59,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:59,781 INFO L225 Difference]: With dead ends: 998 [2025-03-17 05:48:59,781 INFO L226 Difference]: Without dead ends: 525 [2025-03-17 05:48:59,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:48:59,783 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 0 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:59,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 744 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:59,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-17 05:48:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2025-03-17 05:48:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 458 states have (on average 1.3165938864628821) internal successors, (603), 460 states have internal predecessors, (603), 50 states have call successors, (50), 16 states have call predecessors, (50), 16 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 05:48:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 703 transitions. [2025-03-17 05:48:59,818 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 703 transitions. Word has length 159 [2025-03-17 05:48:59,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:59,818 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 703 transitions. [2025-03-17 05:48:59,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:48:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 703 transitions. [2025-03-17 05:48:59,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:48:59,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:59,819 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:48:59,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 05:49:00,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 05:49:00,020 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:00,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:00,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1429453127, now seen corresponding path program 1 times [2025-03-17 05:49:00,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:49:00,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449033515] [2025-03-17 05:49:00,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:00,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:49:00,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:49:00,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:49:00,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:00,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:49:00,080 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:49:00,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:49:00,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:49:00,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:00,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:49:00,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:49:00,257 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:49:00,257 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:49:00,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:49:00,262 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:49:00,462 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:49:00,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:49:00 BoogieIcfgContainer [2025-03-17 05:49:00,465 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:49:00,465 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:49:00,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:49:00,465 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:49:00,467 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:48:47" (3/4) ... [2025-03-17 05:49:00,468 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:49:00,469 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:49:00,470 INFO L158 Benchmark]: Toolchain (without parser) took 13827.02ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 104.9MB in the beginning and 168.4MB in the end (delta: -63.5MB). Peak memory consumption was 247.7MB. Max. memory is 16.1GB. [2025-03-17 05:49:00,470 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:49:00,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.88ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 89.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:49:00,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.63ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 86.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:49:00,471 INFO L158 Benchmark]: Boogie Preprocessor took 70.83ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 80.8MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:49:00,471 INFO L158 Benchmark]: IcfgBuilder took 762.91ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 97.4MB in the end (delta: -16.6MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. [2025-03-17 05:49:00,471 INFO L158 Benchmark]: TraceAbstraction took 12667.77ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 96.7MB in the beginning and 168.5MB in the end (delta: -71.8MB). Peak memory consumption was 238.6MB. Max. memory is 16.1GB. [2025-03-17 05:49:00,471 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 453.0MB. Free memory was 168.5MB in the beginning and 168.4MB in the end (delta: 93.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:49:00,473 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.44ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.88ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 89.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.63ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 86.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.83ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 80.8MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 762.91ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 97.4MB in the end (delta: -16.6MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12667.77ms. Allocated memory was 142.6MB in the beginning and 453.0MB in the end (delta: 310.4MB). Free memory was 96.7MB in the beginning and 168.5MB in the end (delta: -71.8MB). Peak memory consumption was 238.6MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 453.0MB. Free memory was 168.5MB in the beginning and 168.4MB in the end (delta: 93.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] float var_1_2 = 8.3; [L24] float var_1_2 = 8.3; [L25] float* var_1_2_Pointer = &(var_1_2); [L26] float var_1_3 = 2.25; [L26] float var_1_3 = 2.25; [L27] float* var_1_3_Pointer = &(var_1_3); [L28] float var_1_4 = 10.3; [L28] float var_1_4 = 10.3; [L29] float* var_1_4_Pointer = &(var_1_4); [L30] unsigned char var_1_6 = 0; [L30] unsigned char var_1_6 = 0; [L31] unsigned char* var_1_6_Pointer = &(var_1_6); [L32] signed long int var_1_7 = 128; [L32] signed long int var_1_7 = 128; [L33] signed long int* var_1_7_Pointer = &(var_1_7); [L34] float var_1_8 = 9.8; [L34] float var_1_8 = 9.8; [L35] float* var_1_8_Pointer = &(var_1_8); [L36] unsigned long int var_1_13 = 1; [L36] unsigned long int var_1_13 = 1; [L37] unsigned long int* var_1_13_Pointer = &(var_1_13); [L38] unsigned long int var_1_14 = 32; [L38] unsigned long int var_1_14 = 32; [L39] unsigned long int* var_1_14_Pointer = &(var_1_14); [L40] signed char var_1_15 = -10; [L40] signed char var_1_15 = -10; [L41] signed char* var_1_15_Pointer = &(var_1_15); [L42] signed char var_1_16 = 16; [L42] signed char var_1_16 = 16; [L43] signed char* var_1_16_Pointer = &(var_1_16); [L44] signed char var_1_17 = 25; [L44] signed char var_1_17 = 25; [L45] signed char* var_1_17_Pointer = &(var_1_17); [L46] signed char var_1_18 = 1; [L46] signed char var_1_18 = 1; [L47] signed char* var_1_18_Pointer = &(var_1_18); [L48] signed char var_1_19 = 0; [L48] signed char var_1_19 = 0; [L49] signed char* var_1_19_Pointer = &(var_1_19); [L50] signed char var_1_20 = 32; [L50] signed char var_1_20 = 32; [L51] signed char* var_1_20_Pointer = &(var_1_20); [L52] signed short int var_1_21 = 256; [L52] signed short int var_1_21 = 256; [L53] signed short int* var_1_21_Pointer = &(var_1_21); [L54] signed char var_1_22 = 16; [L54] signed char var_1_22 = 16; [L55] signed char* var_1_22_Pointer = &(var_1_22); [L56] unsigned char var_1_23 = 0; [L56] unsigned char var_1_23 = 0; [L57] unsigned char* var_1_23_Pointer = &(var_1_23); [L58] signed short int last_1_var_1_21 = 256; [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L111] EXPR \read(var_1_21) [L111] last_1_var_1_21 = var_1_21 [L121] RET updateLastVariables() [L122] CALL updateVariables() [L80] var_1_2 = __VERIFIER_nondet_float() [L81] EXPR \read(var_1_2) [L81] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L81] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F [L81] EXPR \read(var_1_2) [L81] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L81] EXPR (var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L81] EXPR (var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L81] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L81] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L82] var_1_3 = __VERIFIER_nondet_float() [L83] EXPR \read(var_1_3) [L83] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F [L83] EXPR \read(var_1_3) [L83] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L83] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L84] var_1_4 = __VERIFIER_nondet_float() [L85] EXPR \read(var_1_4) [L85] EXPR var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] EXPR var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F [L85] EXPR \read(var_1_4) [L85] EXPR var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] EXPR (var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] EXPR (var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L85] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L86] var_1_6 = __VERIFIER_nondet_uchar() [L87] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L88] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L89] var_1_8 = __VERIFIER_nondet_float() [L90] EXPR \read(var_1_8) [L90] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F [L90] EXPR \read(var_1_8) [L90] EXPR var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] EXPR (var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L90] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L91] var_1_14 = __VERIFIER_nondet_ulong() [L92] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L92] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L92] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L93] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_14 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_14 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L94] var_1_16 = __VERIFIER_nondet_char() [L95] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L95] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L95] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L96] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L97] var_1_17 = __VERIFIER_nondet_char() [L98] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L98] CALL assume_abort_if_not(var_1_17 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L98] RET assume_abort_if_not(var_1_17 >= -1) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L99] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L99] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L99] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L100] var_1_18 = __VERIFIER_nondet_char() [L101] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L101] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L101] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L102] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L102] CALL assume_abort_if_not(var_1_18 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L102] RET assume_abort_if_not(var_1_18 <= 31) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L103] var_1_19 = __VERIFIER_nondet_char() [L104] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L104] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L104] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L105] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L105] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L105] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L106] var_1_20 = __VERIFIER_nondet_char() [L107] EXPR \read(var_1_20) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L107] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L107] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L108] EXPR \read(var_1_20) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L108] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L108] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L122] RET updateVariables() [L123] CALL step() [L62] EXPR \read(*var_1_14_Pointer) [L62] (*(var_1_13_Pointer)) = (*(var_1_14_Pointer)) [L63] (*(var_1_21_Pointer)) = last_1_var_1_21 [L64] EXPR \read(*var_1_16_Pointer) [L64] (*(var_1_22_Pointer)) = (*(var_1_16_Pointer)) [L65] EXPR \read(*var_1_6_Pointer) [L65] (*(var_1_23_Pointer)) = (*(var_1_6_Pointer)) [L66] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L66] EXPR ((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))) [L66] EXPR ((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L66] EXPR \read(*var_1_3_Pointer) [L66] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L66] COND FALSE !(((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) [L69] EXPR \read(*var_1_22_Pointer) [L69] signed char stepLocal_0 = (*(var_1_22_Pointer)); [L70] EXPR \read(*var_1_22_Pointer) [L70] EXPR \read(*var_1_21_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L70] EXPR (((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer))) [L70] EXPR \read(*var_1_22_Pointer) [L70] EXPR (((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, stepLocal_0=18, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L70] COND FALSE !(stepLocal_0 != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) [L73] EXPR \read(*var_1_4_Pointer) [L73] EXPR \read(*var_1_2_Pointer) [L73] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L73] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) [L73] EXPR \read(*var_1_2_Pointer) [L73] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L73] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L73] COND TRUE (*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer))) [L74] EXPR \read(*var_1_22_Pointer) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR ((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer))) [L74] EXPR \read(*var_1_22_Pointer) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR ((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR ((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))) [L74] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) [L74] EXPR \read(*var_1_15_Pointer) [L74] EXPR (((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] EXPR ((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L74] (*(var_1_7_Pointer)) = ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))) [L114] EXPR ((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR \read(*var_1_3_Pointer) [L114] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1 [L114] EXPR (((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1 VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer))))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer))))) [L114] EXPR \read(*var_1_4_Pointer) [L114] EXPR \read(*var_1_2_Pointer) [L114] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) [L114] EXPR \read(*var_1_2_Pointer) [L114] EXPR (((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))) [L114] EXPR \read(*var_1_7_Pointer) [L114] EXPR \read(*var_1_22_Pointer) [L114] EXPR ((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer))))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21)) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21)) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21))) && ((*(var_1_22_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR ((((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21))) && ((*(var_1_22_Pointer)) == ((signed char) (*(var_1_16_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21))) && ((*(var_1_22_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_23_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114] EXPR (((((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21))) && ((*(var_1_22_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_23_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L114-L115] return (((((((((((1.1f) < ((*(var_1_2_Pointer)))) ? (1.1f) : ((*(var_1_2_Pointer))))) > ((*(var_1_3_Pointer)) * (*(var_1_4_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) ((*(var_1_23_Pointer)) && (*(var_1_6_Pointer))))) : 1) && (((*(var_1_4_Pointer)) <= ((((((*(var_1_2_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_2_Pointer))) : ((*(var_1_3_Pointer))))) * (*(var_1_8_Pointer)))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((((((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) > ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) ? (((((((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) > ((*(var_1_15_Pointer)))) ? (((*(var_1_22_Pointer)) + (*(var_1_15_Pointer)))) : ((*(var_1_15_Pointer)))))) : ((((((*(var_1_15_Pointer))) < 0 ) ? -((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))) : ((*(var_1_7_Pointer)) == ((signed long int) (*(var_1_22_Pointer)))))) && ((*(var_1_13_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && (((*(var_1_22_Pointer)) != (((((*(var_1_22_Pointer))) < ((*(var_1_21_Pointer)))) ? ((*(var_1_22_Pointer))) : ((*(var_1_21_Pointer)))))) ? ((*(var_1_15_Pointer)) == ((signed char) ((((((10 + (*(var_1_16_Pointer)))) < ((*(var_1_17_Pointer)))) ? ((10 + (*(var_1_16_Pointer)))) : ((*(var_1_17_Pointer))))) - ((32 - (*(var_1_18_Pointer))) + (((((*(var_1_19_Pointer))) > ((*(var_1_20_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_20_Pointer))))))))) : 1)) && ((*(var_1_21_Pointer)) == ((signed short int) last_1_var_1_21))) && ((*(var_1_22_Pointer)) == ((signed char) (*(var_1_16_Pointer))))) && ((*(var_1_23_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=256, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_21={19:0}, var_1_21_Pointer={19:0}, var_1_22={20:0}, var_1_22_Pointer={20:0}, var_1_23={21:0}, var_1_23_Pointer={21: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_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 133 locations, 216 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 18, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2321 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2321 mSDsluCounter, 12791 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9269 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 963 IncrementalHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 3522 mSDtfsCounter, 963 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1531 GetRequests, 1401 SyntacticMatches, 2 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=528occurred in iteration=14, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 422 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 4020 NumberOfCodeBlocks, 4020 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3985 ConstructedInterpolants, 0 QuantifiedInterpolants, 9355 SizeOfPredicates, 7 NumberOfNonLiveVariables, 5785 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 15285/15912 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-03-17 05:49:00,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 9c2d9fe6cca3f07b0ec4ef0cef7c77d56847aacde02fd15a5949ee3e6a04e48b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:49:02,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:49:02,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:49:02,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:49:02,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:49:02,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:49:02,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:49:02,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:49:02,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:49:02,465 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:49:02,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:49:02,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:49:02,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:49:02,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:49:02,466 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:49:02,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:49:02,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:49:02,467 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:49:02,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:49:02,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:49:02,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:49:02,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:49:02,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:49:02,467 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:49:02,468 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:49:02,468 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:49:02,468 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:49:02,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:49:02,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:49:02,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:49:02,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:49:02,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:49:02,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:49:02,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:49:02,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:49:02,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:49:02,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:49:02,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:49:02,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:49:02,469 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:49:02,469 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:49:02,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:49:02,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:49:02,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:49:02,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:49:02,470 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/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 -> 9c2d9fe6cca3f07b0ec4ef0cef7c77d56847aacde02fd15a5949ee3e6a04e48b [2025-03-17 05:49:02,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:49:02,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:49:02,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:49:02,703 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:49:02,704 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:49:02,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i [2025-03-17 05:49:03,911 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be6df624/a058cc3d4e234a39b13a8ec52c1e2e5a/FLAG3f0931736 [2025-03-17 05:49:04,128 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:49:04,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i [2025-03-17 05:49:04,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be6df624/a058cc3d4e234a39b13a8ec52c1e2e5a/FLAG3f0931736 [2025-03-17 05:49:04,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be6df624/a058cc3d4e234a39b13a8ec52c1e2e5a [2025-03-17 05:49:04,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:49:04,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:49:04,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:49:04,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:49:04,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:49:04,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:49:04" (1/1) ... [2025-03-17 05:49:04,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a564549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:04, skipping insertion in model container [2025-03-17 05:49:04,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:49:04" (1/1) ... [2025-03-17 05:49:04,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:49:04,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i[916,929] [2025-03-17 05:49:04,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:49:04,377 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:49:04,386 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-63.i[916,929] [2025-03-17 05:49:04,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:49:04,457 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:49:04,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:04 WrapperNode [2025-03-17 05:49:04,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:49:04,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:49:04,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:49:04,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:49:04,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:04" (1/1) ... [2025-03-17 05:49:04,483 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:04" (1/1) ... [2025-03-17 05:49:04,518 INFO L138 Inliner]: procedures = 36, calls = 221, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 703 [2025-03-17 05:49:04,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:49:04,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:49:04,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:49:04,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:49:04,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:04" (1/1) ... [2025-03-17 05:49:04,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:04" (1/1) ... [2025-03-17 05:49:04,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:04" (1/1) ... [2025-03-17 05:49:04,565 INFO L175 MemorySlicer]: Split 174 memory accesses to 19 slices as follows [2, 3, 14, 12, 10, 8, 5, 8, 3, 6, 31, 10, 8, 6, 8, 8, 8, 19, 5]. 18 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-03-17 05:49:04,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:04" (1/1) ... [2025-03-17 05:49:04,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:04" (1/1) ... [2025-03-17 05:49:04,595 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:04" (1/1) ... [2025-03-17 05:49:04,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:04" (1/1) ... [2025-03-17 05:49:04,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:04" (1/1) ... [2025-03-17 05:49:04,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:04" (1/1) ... [2025-03-17 05:49:04,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:49:04,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:49:04,631 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:49:04,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:49:04,632 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:04" (1/1) ... [2025-03-17 05:49:04,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:49:04,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:49:04,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:49:04,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:49:04,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:49:04,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:49:04,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:49:04,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:49:04,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:49:04,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:49:04,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:49:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:49:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-17 05:49:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-17 05:49:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-17 05:49:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-17 05:49:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-17 05:49:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-17 05:49:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-03-17 05:49:04,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-03-17 05:49:04,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2025-03-17 05:49:04,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2025-03-17 05:49:04,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#17 [2025-03-17 05:49:04,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#18 [2025-03-17 05:49:04,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:49:04,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:49:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:49:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:49:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:49:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:49:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-17 05:49:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-17 05:49:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-03-17 05:49:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-03-17 05:49:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-03-17 05:49:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-03-17 05:49:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-03-17 05:49:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#16 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#17 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#18 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#17 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#18 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-17 05:49:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#16 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#17 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#18 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2025-03-17 05:49:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#16 [2025-03-17 05:49:04,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#17 [2025-03-17 05:49:04,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#18 [2025-03-17 05:49:04,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:49:04,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:49:04,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#17 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#18 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:49:04,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#16 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#17 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#18 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#16 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#17 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#18 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:49:04,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:49:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:49:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-17 05:49:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-17 05:49:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-03-17 05:49:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-03-17 05:49:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-03-17 05:49:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-03-17 05:49:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-03-17 05:49:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-03-17 05:49:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-03-17 05:49:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2025-03-17 05:49:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#16 [2025-03-17 05:49:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#17 [2025-03-17 05:49:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#18 [2025-03-17 05:49:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:49:04,693 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:49:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:49:04,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:49:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:49:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:49:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:49:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:49:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:49:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:49:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#17 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#18 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:49:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:49:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:49:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:49:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-17 05:49:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-17 05:49:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-03-17 05:49:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-03-17 05:49:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-03-17 05:49:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-03-17 05:49:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-03-17 05:49:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2025-03-17 05:49:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2025-03-17 05:49:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2025-03-17 05:49:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#16 [2025-03-17 05:49:04,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#17 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#18 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#17 [2025-03-17 05:49:04,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#18 [2025-03-17 05:49:04,928 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:49:04,929 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:49:06,691 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~mem117#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short124#1;havoc property_#t~mem133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite160#1;havoc property_#t~mem157#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite156#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1;havoc property_#t~mem170#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~ite169#1;havoc property_#t~mem167#1;havoc property_#t~mem168#1;havoc property_#t~ite183#1;havoc property_#t~mem182#1;havoc property_#t~mem171#1;havoc property_#t~mem172#1;havoc property_#t~ite175#1;havoc property_#t~mem173#1;havoc property_#t~mem174#1;havoc property_#t~mem176#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite181#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~short184#1;havoc property_#t~mem185#1;havoc property_#t~short186#1;havoc property_#t~mem188#1;havoc property_#t~mem187#1;havoc property_#t~short189#1;havoc property_#t~mem191#1;havoc property_#t~mem190#1;havoc property_#t~short192#1; [2025-03-17 05:49:06,743 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2025-03-17 05:49:06,743 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:49:06,752 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:49:06,754 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:49:06,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:49:06 BoogieIcfgContainer [2025-03-17 05:49:06,754 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:49:06,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:49:06,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:49:06,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:49:06,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:49:04" (1/3) ... [2025-03-17 05:49:06,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60bd96aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:49:06, skipping insertion in model container [2025-03-17 05:49:06,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:49:04" (2/3) ... [2025-03-17 05:49:06,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60bd96aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:49:06, skipping insertion in model container [2025-03-17 05:49:06,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:49:06" (3/3) ... [2025-03-17 05:49:06,762 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-63.i [2025-03-17 05:49:06,772 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:49:06,775 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-63.i that has 2 procedures, 133 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:49:06,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:49:06,826 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;@7fe80ec4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:49:06,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:49:06,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 113 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:49:06,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:49:06,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:06,839 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:49:06,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:06,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:06,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2121181810, now seen corresponding path program 1 times [2025-03-17 05:49:06,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:06,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115070333] [2025-03-17 05:49:06,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:06,853 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-03-17 05:49:06,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:06,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:06,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:07,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:49:07,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:49:07,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:07,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:07,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:49:07,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-17 05:49:07,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:07,467 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:07,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115070333] [2025-03-17 05:49:07,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115070333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:07,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:07,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:49:07,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592445432] [2025-03-17 05:49:07,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:07,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:49:07,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:07,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:49:07,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:49:07,490 INFO L87 Difference]: Start difference. First operand has 133 states, 112 states have (on average 1.4464285714285714) internal successors, (162), 113 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:49:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:07,509 INFO L93 Difference]: Finished difference Result 263 states and 412 transitions. [2025-03-17 05:49:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:49:07,511 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 152 [2025-03-17 05:49:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:07,516 INFO L225 Difference]: With dead ends: 263 [2025-03-17 05:49:07,516 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 05:49:07,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-03-17 05:49:07,520 INFO L435 NwaCegarLoop]: 194 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, 194 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-03-17 05:49:07,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 05:49:07,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-17 05:49:07,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 111 states have (on average 1.4234234234234233) internal successors, (158), 111 states have internal predecessors, (158), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:49:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 194 transitions. [2025-03-17 05:49:07,562 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 194 transitions. Word has length 152 [2025-03-17 05:49:07,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:07,562 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 194 transitions. [2025-03-17 05:49:07,563 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:49:07,563 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 194 transitions. [2025-03-17 05:49:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:49:07,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:07,568 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:49:07,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:07,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:07,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:07,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:07,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1975702652, now seen corresponding path program 1 times [2025-03-17 05:49:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:07,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054462969] [2025-03-17 05:49:07,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:07,772 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-03-17 05:49:07,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:07,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:07,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:07,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:49:08,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:49:08,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:08,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:08,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:49:08,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-17 05:49:08,316 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:08,316 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:08,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054462969] [2025-03-17 05:49:08,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054462969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:08,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:08,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:49:08,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536434637] [2025-03-17 05:49:08,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:08,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:49:08,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:08,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:49:08,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:49:08,318 INFO L87 Difference]: Start difference. First operand 131 states and 194 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:49:08,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:08,384 INFO L93 Difference]: Finished difference Result 263 states and 390 transitions. [2025-03-17 05:49:08,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:49:08,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 152 [2025-03-17 05:49:08,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:08,391 INFO L225 Difference]: With dead ends: 263 [2025-03-17 05:49:08,393 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 05:49:08,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 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-03-17 05:49:08,394 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:08,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:08,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 05:49:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-03-17 05:49:08,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 113 states have (on average 1.415929203539823) internal successors, (160), 113 states have internal predecessors, (160), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:49:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2025-03-17 05:49:08,409 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 152 [2025-03-17 05:49:08,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:08,410 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2025-03-17 05:49:08,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:49:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2025-03-17 05:49:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:49:08,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:08,414 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:49:08,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:08,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:08,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:08,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:08,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1152021181, now seen corresponding path program 1 times [2025-03-17 05:49:08,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:08,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632098510] [2025-03-17 05:49:08,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:08,616 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-03-17 05:49:08,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:08,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:08,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:49:08,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:49:09,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:49:09,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:09,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:09,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:49:09,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:49:09,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:09,138 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:09,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632098510] [2025-03-17 05:49:09,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632098510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:09,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:09,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:49:09,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260770260] [2025-03-17 05:49:09,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:09,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:49:09,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:09,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:49:09,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:49:09,140 INFO L87 Difference]: Start difference. First operand 133 states and 196 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:49:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:09,164 INFO L93 Difference]: Finished difference Result 267 states and 394 transitions. [2025-03-17 05:49:09,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:49:09,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 152 [2025-03-17 05:49:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:09,165 INFO L225 Difference]: With dead ends: 267 [2025-03-17 05:49:09,165 INFO L226 Difference]: Without dead ends: 135 [2025-03-17 05:49:09,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 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-03-17 05:49:09,166 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:09,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-17 05:49:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-17 05:49:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:49:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-03-17 05:49:09,180 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 152 [2025-03-17 05:49:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:09,181 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-03-17 05:49:09,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:49:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-03-17 05:49:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:49:09,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:09,184 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:49:09,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:49:09,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:09,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:09,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:09,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1723288897, now seen corresponding path program 1 times [2025-03-17 05:49:09,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:09,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187655487] [2025-03-17 05:49:09,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:09,385 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-03-17 05:49:09,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:09,387 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:09,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:09,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:49:09,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:49:09,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:09,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:09,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:49:09,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:10,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-03-17 05:49:10,284 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 13 treesize of output 9 [2025-03-17 05:49:10,417 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 21 [2025-03-17 05:49:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:49:10,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:49:10,747 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-17 05:49:10,747 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 20 treesize of output 19 [2025-03-17 05:49:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:49:10,847 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:10,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187655487] [2025-03-17 05:49:10,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187655487] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:49:10,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:49:10,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-03-17 05:49:10,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214360168] [2025-03-17 05:49:10,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:49:10,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:49:10,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:10,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:49:10,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:49:10,848 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 13 states, 11 states have (on average 8.636363636363637) internal successors, (95), 13 states have internal predecessors, (95), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-17 05:49:11,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:11,814 INFO L93 Difference]: Finished difference Result 277 states and 402 transitions. [2025-03-17 05:49:11,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:49:11,815 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.636363636363637) internal successors, (95), 13 states have internal predecessors, (95), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) Word has length 154 [2025-03-17 05:49:11,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:11,816 INFO L225 Difference]: With dead ends: 277 [2025-03-17 05:49:11,816 INFO L226 Difference]: Without dead ends: 143 [2025-03-17 05:49:11,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:49:11,818 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 693 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:11,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 763 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:49:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-17 05:49:11,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2025-03-17 05:49:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 118 states have (on average 1.3898305084745763) internal successors, (164), 118 states have internal predecessors, (164), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:49:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 200 transitions. [2025-03-17 05:49:11,828 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 200 transitions. Word has length 154 [2025-03-17 05:49:11,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:11,829 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 200 transitions. [2025-03-17 05:49:11,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.636363636363637) internal successors, (95), 13 states have internal predecessors, (95), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-17 05:49:11,829 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 200 transitions. [2025-03-17 05:49:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:49:11,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:11,830 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:49:11,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:12,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:12,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:12,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:12,031 INFO L85 PathProgramCache]: Analyzing trace with hash 726216544, now seen corresponding path program 1 times [2025-03-17 05:49:12,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:12,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527110023] [2025-03-17 05:49:12,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:12,032 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-03-17 05:49:12,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:12,035 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:12,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 05:49:12,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:49:12,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:49:12,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:12,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:12,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:49:12,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:13,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-03-17 05:49:13,295 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 13 treesize of output 9 [2025-03-17 05:49:13,460 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-03-17 05:49:13,466 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 21 [2025-03-17 05:49:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:49:13,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:49:14,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:49:14,413 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 53 treesize of output 52 [2025-03-17 05:49:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:49:14,600 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:14,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527110023] [2025-03-17 05:49:14,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527110023] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:49:14,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:49:14,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2025-03-17 05:49:14,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802904646] [2025-03-17 05:49:14,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:49:14,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 05:49:14,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:14,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 05:49:14,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:49:14,602 INFO L87 Difference]: Start difference. First operand 139 states and 200 transitions. Second operand has 20 states, 18 states have (on average 7.111111111111111) internal successors, (128), 19 states have internal predecessors, (128), 6 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 6 states have call successors, (36) [2025-03-17 05:49:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:16,690 INFO L93 Difference]: Finished difference Result 423 states and 606 transitions. [2025-03-17 05:49:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 05:49:16,690 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.111111111111111) internal successors, (128), 19 states have internal predecessors, (128), 6 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 6 states have call successors, (36) Word has length 154 [2025-03-17 05:49:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:16,692 INFO L225 Difference]: With dead ends: 423 [2025-03-17 05:49:16,692 INFO L226 Difference]: Without dead ends: 285 [2025-03-17 05:49:16,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=240, Invalid=816, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 05:49:16,693 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 551 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 2730 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:16,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 2730 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 05:49:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-17 05:49:16,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 271. [2025-03-17 05:49:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 230 states have (on average 1.391304347826087) internal successors, (320), 230 states have internal predecessors, (320), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:49:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 392 transitions. [2025-03-17 05:49:16,720 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 392 transitions. Word has length 154 [2025-03-17 05:49:16,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:16,720 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 392 transitions. [2025-03-17 05:49:16,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.111111111111111) internal successors, (128), 19 states have internal predecessors, (128), 6 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 4 states have call predecessors, (36), 6 states have call successors, (36) [2025-03-17 05:49:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 392 transitions. [2025-03-17 05:49:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:49:16,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:16,722 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:49:16,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 05:49:16,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:16,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:16,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:16,923 INFO L85 PathProgramCache]: Analyzing trace with hash -379151774, now seen corresponding path program 1 times [2025-03-17 05:49:16,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:16,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770105234] [2025-03-17 05:49:16,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:16,924 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-03-17 05:49:16,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:16,926 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:16,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:17,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:49:17,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:49:17,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:17,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:17,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:49:17,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:17,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-03-17 05:49:17,704 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 13 treesize of output 9 [2025-03-17 05:49:17,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 33 treesize of output 21 [2025-03-17 05:49:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:49:17,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:49:17,945 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-17 05:49:17,946 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 20 treesize of output 19 [2025-03-17 05:49:18,004 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:49:18,004 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:18,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770105234] [2025-03-17 05:49:18,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770105234] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:49:18,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:49:18,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-03-17 05:49:18,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417687132] [2025-03-17 05:49:18,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:49:18,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:49:18,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:18,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:49:18,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:49:18,006 INFO L87 Difference]: Start difference. First operand 271 states and 392 transitions. Second operand has 13 states, 11 states have (on average 7.818181818181818) internal successors, (86), 13 states have internal predecessors, (86), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-17 05:49:19,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:19,089 INFO L93 Difference]: Finished difference Result 417 states and 599 transitions. [2025-03-17 05:49:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:49:19,089 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.818181818181818) internal successors, (86), 13 states have internal predecessors, (86), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) Word has length 156 [2025-03-17 05:49:19,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:19,091 INFO L225 Difference]: With dead ends: 417 [2025-03-17 05:49:19,091 INFO L226 Difference]: Without dead ends: 279 [2025-03-17 05:49:19,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:49:19,092 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 724 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:19,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 766 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:49:19,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-17 05:49:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 271. [2025-03-17 05:49:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 230 states have (on average 1.3869565217391304) internal successors, (319), 230 states have internal predecessors, (319), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:49:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 391 transitions. [2025-03-17 05:49:19,108 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 391 transitions. Word has length 156 [2025-03-17 05:49:19,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:19,109 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 391 transitions. [2025-03-17 05:49:19,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.818181818181818) internal successors, (86), 13 states have internal predecessors, (86), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-17 05:49:19,109 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 391 transitions. [2025-03-17 05:49:19,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:49:19,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:19,110 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:49:19,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:19,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:19,311 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:19,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:19,311 INFO L85 PathProgramCache]: Analyzing trace with hash -28351837, now seen corresponding path program 1 times [2025-03-17 05:49:19,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:19,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853967286] [2025-03-17 05:49:19,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:19,312 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-03-17 05:49:19,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:19,313 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:19,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 05:49:19,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:49:19,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:49:19,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:19,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:19,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:49:19,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:20,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-03-17 05:49:20,063 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 13 treesize of output 9 [2025-03-17 05:49:20,145 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-03-17 05:49:20,244 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-03-17 05:49:20,247 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 21 [2025-03-17 05:49:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:49:20,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:49:20,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 26 treesize of output 22 [2025-03-17 05:49:20,499 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 05:49:20,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:49:20,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2025-03-17 05:49:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:49:20,657 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:20,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853967286] [2025-03-17 05:49:20,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853967286] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:49:20,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:49:20,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 17 [2025-03-17 05:49:20,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182389706] [2025-03-17 05:49:20,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:20,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:49:20,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:20,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:49:20,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:49:20,659 INFO L87 Difference]: Start difference. First operand 271 states and 391 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:49:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:21,765 INFO L93 Difference]: Finished difference Result 611 states and 877 transitions. [2025-03-17 05:49:21,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:49:21,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-17 05:49:21,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:21,769 INFO L225 Difference]: With dead ends: 611 [2025-03-17 05:49:21,770 INFO L226 Difference]: Without dead ends: 473 [2025-03-17 05:49:21,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:49:21,771 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 172 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:21,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1482 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 05:49:21,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-17 05:49:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 297. [2025-03-17 05:49:21,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 256 states have (on average 1.3984375) internal successors, (358), 256 states have internal predecessors, (358), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:49:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 430 transitions. [2025-03-17 05:49:21,804 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 430 transitions. Word has length 156 [2025-03-17 05:49:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:21,805 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 430 transitions. [2025-03-17 05:49:21,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:49:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 430 transitions. [2025-03-17 05:49:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:49:21,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:21,807 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:49:21,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 05:49:22,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:22,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:22,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:22,008 INFO L85 PathProgramCache]: Analyzing trace with hash 987242417, now seen corresponding path program 1 times [2025-03-17 05:49:22,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:22,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283977243] [2025-03-17 05:49:22,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:22,009 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-03-17 05:49:22,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:22,011 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:22,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:22,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:49:22,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:49:22,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:22,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:22,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:49:22,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:22,590 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 11 [2025-03-17 05:49:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:49:22,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:22,642 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:22,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283977243] [2025-03-17 05:49:22,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283977243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:22,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:22,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:49:22,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788597132] [2025-03-17 05:49:22,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:22,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:49:22,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:22,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:49:22,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:49:22,643 INFO L87 Difference]: Start difference. First operand 297 states and 430 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:49:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:22,719 INFO L93 Difference]: Finished difference Result 644 states and 927 transitions. [2025-03-17 05:49:22,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:49:22,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-17 05:49:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:22,723 INFO L225 Difference]: With dead ends: 644 [2025-03-17 05:49:22,723 INFO L226 Difference]: Without dead ends: 348 [2025-03-17 05:49:22,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:49:22,724 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 135 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:22,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 802 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:49:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-17 05:49:22,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 347. [2025-03-17 05:49:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 297 states have (on average 1.3838383838383839) internal successors, (411), 298 states have internal predecessors, (411), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:49:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 495 transitions. [2025-03-17 05:49:22,755 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 495 transitions. Word has length 156 [2025-03-17 05:49:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:22,757 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 495 transitions. [2025-03-17 05:49:22,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:49:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 495 transitions. [2025-03-17 05:49:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:49:22,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:22,758 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:49:22,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:22,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:22,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:22,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:22,960 INFO L85 PathProgramCache]: Analyzing trace with hash 693839410, now seen corresponding path program 1 times [2025-03-17 05:49:22,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:22,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940737476] [2025-03-17 05:49:22,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:22,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:49:22,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:22,962 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:22,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:23,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 05:49:23,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 05:49:23,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:23,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:23,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:49:23,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:23,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-17 05:49:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:49:23,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:23,577 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:23,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940737476] [2025-03-17 05:49:23,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940737476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:23,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:23,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:49:23,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549888695] [2025-03-17 05:49:23,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:23,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:49:23,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:23,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:49:23,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:49:23,578 INFO L87 Difference]: Start difference. First operand 347 states and 495 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:49:24,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:24,850 INFO L93 Difference]: Finished difference Result 901 states and 1276 transitions. [2025-03-17 05:49:24,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:49:24,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-03-17 05:49:24,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:24,854 INFO L225 Difference]: With dead ends: 901 [2025-03-17 05:49:24,854 INFO L226 Difference]: Without dead ends: 593 [2025-03-17 05:49:24,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:49:24,857 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 147 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:24,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1246 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 05:49:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-17 05:49:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 486. [2025-03-17 05:49:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 415 states have (on average 1.3662650602409638) internal successors, (567), 417 states have internal predecessors, (567), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:49:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 687 transitions. [2025-03-17 05:49:24,893 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 687 transitions. Word has length 156 [2025-03-17 05:49:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:24,894 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 687 transitions. [2025-03-17 05:49:24,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:49:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 687 transitions. [2025-03-17 05:49:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 05:49:24,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:24,895 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:49:24,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-17 05:49:25,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:25,096 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:25,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:25,096 INFO L85 PathProgramCache]: Analyzing trace with hash -669412172, now seen corresponding path program 1 times [2025-03-17 05:49:25,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:25,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677337177] [2025-03-17 05:49:25,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:25,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:49:25,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:25,102 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:25,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:25,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 05:49:25,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 05:49:25,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:25,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:25,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:49:25,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:25,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-17 05:49:26,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2025-03-17 05:49:26,110 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 39 treesize of output 27 [2025-03-17 05:49:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 263 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:49:26,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:49:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:49:26,287 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:26,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677337177] [2025-03-17 05:49:26,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677337177] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:49:26,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:49:26,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2025-03-17 05:49:26,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170991246] [2025-03-17 05:49:26,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:26,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:49:26,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:26,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:49:26,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:49:26,288 INFO L87 Difference]: Start difference. First operand 486 states and 687 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:49:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:26,624 INFO L93 Difference]: Finished difference Result 513 states and 712 transitions. [2025-03-17 05:49:26,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:49:26,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 159 [2025-03-17 05:49:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:26,627 INFO L225 Difference]: With dead ends: 513 [2025-03-17 05:49:26,627 INFO L226 Difference]: Without dead ends: 511 [2025-03-17 05:49:26,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:49:26,628 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 108 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:26,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 788 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:49:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-17 05:49:26,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-03-17 05:49:26,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 436 states have (on average 1.348623853211009) internal successors, (588), 438 states have internal predecessors, (588), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:49:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 708 transitions. [2025-03-17 05:49:26,660 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 708 transitions. Word has length 159 [2025-03-17 05:49:26,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:26,660 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 708 transitions. [2025-03-17 05:49:26,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:49:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 708 transitions. [2025-03-17 05:49:26,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 05:49:26,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:26,662 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:49:26,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-17 05:49:26,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:26,863 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:26,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:26,863 INFO L85 PathProgramCache]: Analyzing trace with hash -668488651, now seen corresponding path program 1 times [2025-03-17 05:49:26,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:26,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59765205] [2025-03-17 05:49:26,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:26,864 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-03-17 05:49:26,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:26,865 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:26,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:27,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 05:49:27,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 05:49:27,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:27,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:27,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:49:27,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:28,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2025-03-17 05:49:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:49:28,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:28,620 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:28,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59765205] [2025-03-17 05:49:28,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59765205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:28,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:28,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:49:28,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774053366] [2025-03-17 05:49:28,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:28,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:49:28,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:28,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:49:28,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:49:28,621 INFO L87 Difference]: Start difference. First operand 511 states and 708 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:49:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:34,074 INFO L93 Difference]: Finished difference Result 1476 states and 2043 transitions. [2025-03-17 05:49:34,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:49:34,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 159 [2025-03-17 05:49:34,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:34,089 INFO L225 Difference]: With dead ends: 1476 [2025-03-17 05:49:34,089 INFO L226 Difference]: Without dead ends: 1008 [2025-03-17 05:49:34,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:49:34,090 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 456 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:34,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 744 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-17 05:49:34,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-03-17 05:49:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 763. [2025-03-17 05:49:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 614 states have (on average 1.3127035830618892) internal successors, (806), 618 states have internal predecessors, (806), 120 states have call successors, (120), 28 states have call predecessors, (120), 28 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-17 05:49:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1046 transitions. [2025-03-17 05:49:34,165 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1046 transitions. Word has length 159 [2025-03-17 05:49:34,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:34,165 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1046 transitions. [2025-03-17 05:49:34,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:49:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1046 transitions. [2025-03-17 05:49:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 05:49:34,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:34,167 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:49:34,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:34,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:34,368 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:34,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:34,368 INFO L85 PathProgramCache]: Analyzing trace with hash -338722890, now seen corresponding path program 1 times [2025-03-17 05:49:34,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:34,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49748353] [2025-03-17 05:49:34,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:34,369 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-03-17 05:49:34,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:34,371 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:34,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:34,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 05:49:34,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 05:49:34,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:34,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:34,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:49:35,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:36,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 70 treesize of output 34 [2025-03-17 05:49:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:49:36,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:49:36,546 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:49:36,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49748353] [2025-03-17 05:49:36,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49748353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:49:36,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:49:36,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:49:36,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471829094] [2025-03-17 05:49:36,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:49:36,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:49:36,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:49:36,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:49:36,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:49:36,547 INFO L87 Difference]: Start difference. First operand 763 states and 1046 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:49:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:49:41,668 INFO L93 Difference]: Finished difference Result 1690 states and 2327 transitions. [2025-03-17 05:49:41,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:49:41,677 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 159 [2025-03-17 05:49:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:49:41,681 INFO L225 Difference]: With dead ends: 1690 [2025-03-17 05:49:41,681 INFO L226 Difference]: Without dead ends: 1008 [2025-03-17 05:49:41,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:49:41,683 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 443 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:49:41,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 742 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-17 05:49:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-03-17 05:49:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 841. [2025-03-17 05:49:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 692 states have (on average 1.3280346820809248) internal successors, (919), 696 states have internal predecessors, (919), 120 states have call successors, (120), 28 states have call predecessors, (120), 28 states have return successors, (120), 116 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-17 05:49:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1159 transitions. [2025-03-17 05:49:41,746 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1159 transitions. Word has length 159 [2025-03-17 05:49:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:49:41,747 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1159 transitions. [2025-03-17 05:49:41,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:49:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1159 transitions. [2025-03-17 05:49:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-17 05:49:41,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:49:41,749 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:49:41,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:41,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:41,949 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:49:41,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:49:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash -307703083, now seen corresponding path program 1 times [2025-03-17 05:49:41,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:49:41,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523146415] [2025-03-17 05:49:41,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:49:41,950 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-03-17 05:49:41,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:49:41,953 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-03-17 05:49:41,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-17 05:49:42,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-17 05:49:42,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-17 05:49:42,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:49:42,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:49:42,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 05:49:42,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:49:47,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2025-03-17 05:49:48,139 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 91 treesize of output 43 [2025-03-17 05:49:48,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2025-03-17 05:49:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 284 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-17 05:49:48,845 INFO L312 TraceCheckSpWp]: Computing backward predicates...