./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-88.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-ap_file-88.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 9f13b6ec153b424c9c18800ebe21aa9579fe753fb31fef85cd6c1089c45b899c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:40:33,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:40:33,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:40:33,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:40:33,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:40:33,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:40:33,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:40:33,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:40:33,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:40:33,157 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:40:33,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:40:33,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:40:33,157 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:40:33,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:40:33,157 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:40:33,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:40:33,158 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:40:33,158 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:40:33,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:40:33,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:40:33,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:40:33,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:40:33,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:40:33,158 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:40:33,158 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:40:33,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:40:33,158 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:40:33,158 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:40:33,159 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:40:33,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:40:33,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:40:33,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:40:33,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:40:33,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:40:33,159 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:40:33,159 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:40:33,159 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:40:33,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:40:33,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:40:33,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:40:33,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:40:33,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:40:33,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:40:33,160 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 -> 9f13b6ec153b424c9c18800ebe21aa9579fe753fb31fef85cd6c1089c45b899c [2025-03-17 05:40:33,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:40:33,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:40:33,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:40:33,375 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:40:33,375 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:40:33,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-88.i [2025-03-17 05:40:34,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/919010a2b/5785b83d3ef545c2a1b2ab00ff813d6c/FLAGa574adcc3 [2025-03-17 05:40:34,711 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:40:34,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-88.i [2025-03-17 05:40:34,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/919010a2b/5785b83d3ef545c2a1b2ab00ff813d6c/FLAGa574adcc3 [2025-03-17 05:40:35,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/919010a2b/5785b83d3ef545c2a1b2ab00ff813d6c [2025-03-17 05:40:35,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:40:35,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:40:35,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:40:35,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:40:35,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:40:35,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:40:35" (1/1) ... [2025-03-17 05:40:35,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@269417ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:35, skipping insertion in model container [2025-03-17 05:40:35,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:40:35" (1/1) ... [2025-03-17 05:40:35,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:40:35,163 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-ap_file-88.i[917,930] [2025-03-17 05:40:35,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:40:35,241 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:40:35,249 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-ap_file-88.i[917,930] [2025-03-17 05:40:35,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:40:35,305 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:40:35,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:35 WrapperNode [2025-03-17 05:40:35,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:40:35,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:40:35,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:40:35,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:40:35,312 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:40:35" (1/1) ... [2025-03-17 05:40:35,321 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:40:35" (1/1) ... [2025-03-17 05:40:35,354 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 544 [2025-03-17 05:40:35,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:40:35,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:40:35,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:40:35,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:40:35,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:35" (1/1) ... [2025-03-17 05:40:35,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:35" (1/1) ... [2025-03-17 05:40:35,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:35" (1/1) ... [2025-03-17 05:40:35,382 INFO L175 MemorySlicer]: Split 134 memory accesses to 8 slices as follows [2, 16, 11, 54, 3, 4, 10, 34]. 40 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 4, 1, 1, 2, 4]. The 19 writes are split as follows [0, 2, 2, 6, 1, 1, 2, 5]. [2025-03-17 05:40:35,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:35" (1/1) ... [2025-03-17 05:40:35,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:35" (1/1) ... [2025-03-17 05:40:35,394 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:35" (1/1) ... [2025-03-17 05:40:35,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:35" (1/1) ... [2025-03-17 05:40:35,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:35" (1/1) ... [2025-03-17 05:40:35,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:35" (1/1) ... [2025-03-17 05:40:35,404 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:40:35,405 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:40:35,405 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:40:35,405 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:40:35,406 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:35" (1/1) ... [2025-03-17 05:40:35,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:40:35,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:40:35,431 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:40:35,433 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:40:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:40:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:40:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:40:35,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:40:35,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:40:35,453 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:40:35,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:40:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:40:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:40:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:40:35,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:40:35,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:40:35,585 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:40:35,586 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:40:35,982 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~bitwise79#1;havoc property_#t~mem80#1;havoc property_#t~short81#1;havoc property_#t~ite92#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem93#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~ite121#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~ite115#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite130#1;havoc property_#t~mem129#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~short133#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~short136#1;havoc property_#t~mem138#1;havoc property_#t~mem137#1;havoc property_#t~short139#1; [2025-03-17 05:40:36,028 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-03-17 05:40:36,028 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:40:36,047 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:40:36,048 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:40:36,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:40:36 BoogieIcfgContainer [2025-03-17 05:40:36,049 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:40:36,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:40:36,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:40:36,054 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:40:36,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:40:35" (1/3) ... [2025-03-17 05:40:36,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d1c53d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:40:36, skipping insertion in model container [2025-03-17 05:40:36,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:40:35" (2/3) ... [2025-03-17 05:40:36,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d1c53d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:40:36, skipping insertion in model container [2025-03-17 05:40:36,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:40:36" (3/3) ... [2025-03-17 05:40:36,056 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-88.i [2025-03-17 05:40:36,067 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:40:36,068 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-88.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:40:36,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:40:36,115 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;@388159e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:40:36,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:40:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:40:36,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:40:36,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:36,129 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:36,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:36,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash 42772648, now seen corresponding path program 1 times [2025-03-17 05:40:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:36,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751827532] [2025-03-17 05:40:36,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:36,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:36,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:40:36,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:40:36,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:36,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:40:36,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:36,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751827532] [2025-03-17 05:40:36,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751827532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:40:36,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90449308] [2025-03-17 05:40:36,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:36,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:40:36,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:40:36,441 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:40:36,442 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:40:36,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:40:36,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:40:36,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:36,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:36,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:40:36,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:40:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:40:36,692 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:40:36,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90449308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:36,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:40:36,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:40:36,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629273407] [2025-03-17 05:40:36,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:36,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:40:36,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:36,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:40:36,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:40:36,715 INFO L87 Difference]: Start difference. First operand has 113 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:40:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:36,739 INFO L93 Difference]: Finished difference Result 223 states and 351 transitions. [2025-03-17 05:40:36,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:40:36,741 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-17 05:40:36,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:36,745 INFO L225 Difference]: With dead ends: 223 [2025-03-17 05:40:36,745 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 05:40:36,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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:40:36,749 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:36,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 05:40:36,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-17 05:40:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:40:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 164 transitions. [2025-03-17 05:40:36,783 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 164 transitions. Word has length 139 [2025-03-17 05:40:36,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:36,784 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 164 transitions. [2025-03-17 05:40:36,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:40:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 164 transitions. [2025-03-17 05:40:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:40:36,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:36,789 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:36,796 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:40:36,990 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:40:36,990 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:36,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:36,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1083821697, now seen corresponding path program 1 times [2025-03-17 05:40:36,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:36,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659325330] [2025-03-17 05:40:36,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:36,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:37,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:40:37,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:40:37,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:37,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:37,291 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:37,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:37,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659325330] [2025-03-17 05:40:37,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659325330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:37,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:37,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:40:37,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697548921] [2025-03-17 05:40:37,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:37,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:40:37,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:37,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:40:37,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:40:37,296 INFO L87 Difference]: Start difference. First operand 111 states and 164 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:37,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:37,344 INFO L93 Difference]: Finished difference Result 224 states and 331 transitions. [2025-03-17 05:40:37,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:40:37,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-17 05:40:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:37,348 INFO L225 Difference]: With dead ends: 224 [2025-03-17 05:40:37,348 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 05:40:37,349 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:40:37,349 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:37,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 466 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 05:40:37,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-17 05:40:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:40:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions. [2025-03-17 05:40:37,367 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 139 [2025-03-17 05:40:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:37,368 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 166 transitions. [2025-03-17 05:40:37,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:37,369 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions. [2025-03-17 05:40:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:40:37,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:37,371 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:37,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:40:37,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:37,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1403691136, now seen corresponding path program 1 times [2025-03-17 05:40:37,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:37,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852752875] [2025-03-17 05:40:37,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:37,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:37,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:40:37,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:40:37,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:37,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:37,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:37,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852752875] [2025-03-17 05:40:37,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852752875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:37,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:37,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:40:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750158908] [2025-03-17 05:40:37,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:37,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:40:37,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:37,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:40:37,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:40:37,560 INFO L87 Difference]: Start difference. First operand 113 states and 166 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:37,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:37,597 INFO L93 Difference]: Finished difference Result 228 states and 335 transitions. [2025-03-17 05:40:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:40:37,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-17 05:40:37,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:37,601 INFO L225 Difference]: With dead ends: 228 [2025-03-17 05:40:37,601 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 05:40:37,601 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:40:37,603 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:37,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 467 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:37,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 05:40:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-17 05:40:37,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:40:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2025-03-17 05:40:37,612 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 139 [2025-03-17 05:40:37,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:37,612 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2025-03-17 05:40:37,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2025-03-17 05:40:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:40:37,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:37,619 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:37,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:40:37,620 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:37,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:37,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2003772479, now seen corresponding path program 1 times [2025-03-17 05:40:37,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:37,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032420190] [2025-03-17 05:40:37,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:37,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:37,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:40:37,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:40:37,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:37,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:37,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:37,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032420190] [2025-03-17 05:40:37,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032420190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:37,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:37,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:40:37,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493051155] [2025-03-17 05:40:37,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:37,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:40:37,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:37,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:40:37,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:40:37,783 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:37,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:37,809 INFO L93 Difference]: Finished difference Result 232 states and 339 transitions. [2025-03-17 05:40:37,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:40:37,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-17 05:40:37,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:37,810 INFO L225 Difference]: With dead ends: 232 [2025-03-17 05:40:37,812 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 05:40:37,812 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:40:37,813 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:37,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 469 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:37,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 05:40:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-17 05:40:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:40:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2025-03-17 05:40:37,824 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 139 [2025-03-17 05:40:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:37,826 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2025-03-17 05:40:37,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2025-03-17 05:40:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:40:37,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:37,827 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:37,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:40:37,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:37,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:37,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2002848958, now seen corresponding path program 1 times [2025-03-17 05:40:37,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:37,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357954473] [2025-03-17 05:40:37,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:37,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:37,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:40:37,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:40:37,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:37,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:38,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:38,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357954473] [2025-03-17 05:40:38,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357954473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:38,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:38,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:40:38,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366194231] [2025-03-17 05:40:38,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:38,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:40:38,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:38,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:40:38,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:40:38,411 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:38,676 INFO L93 Difference]: Finished difference Result 315 states and 455 transitions. [2025-03-17 05:40:38,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:40:38,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-17 05:40:38,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:38,678 INFO L225 Difference]: With dead ends: 315 [2025-03-17 05:40:38,679 INFO L226 Difference]: Without dead ends: 199 [2025-03-17 05:40:38,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:40:38,680 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 255 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:38,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 650 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:40:38,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-17 05:40:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2025-03-17 05:40:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 171 states have (on average 1.3976608187134503) internal successors, (239), 172 states have internal predecessors, (239), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:40:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 283 transitions. [2025-03-17 05:40:38,702 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 283 transitions. Word has length 139 [2025-03-17 05:40:38,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:38,703 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 283 transitions. [2025-03-17 05:40:38,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 283 transitions. [2025-03-17 05:40:38,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:40:38,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:38,706 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:38,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:40:38,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:38,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:38,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1448747008, now seen corresponding path program 1 times [2025-03-17 05:40:38,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:38,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647252073] [2025-03-17 05:40:38,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:38,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:38,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:40:38,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:40:38,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:38,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:39,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:39,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647252073] [2025-03-17 05:40:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647252073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:39,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:39,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:40:39,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474013909] [2025-03-17 05:40:39,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:39,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:40:39,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:39,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:40:39,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:40:39,558 INFO L87 Difference]: Start difference. First operand 196 states and 283 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:40:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:39,839 INFO L93 Difference]: Finished difference Result 413 states and 595 transitions. [2025-03-17 05:40:39,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:40:39,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2025-03-17 05:40:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:39,842 INFO L225 Difference]: With dead ends: 413 [2025-03-17 05:40:39,842 INFO L226 Difference]: Without dead ends: 218 [2025-03-17 05:40:39,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:40:39,843 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 542 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:39,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 478 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:40:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-17 05:40:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 138. [2025-03-17 05:40:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 114 states have internal predecessors, (154), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:40:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 198 transitions. [2025-03-17 05:40:39,858 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 198 transitions. Word has length 141 [2025-03-17 05:40:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:39,859 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 198 transitions. [2025-03-17 05:40:39,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:40:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 198 transitions. [2025-03-17 05:40:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:40:39,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:39,860 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:39,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:40:39,860 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:39,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash -450692708, now seen corresponding path program 1 times [2025-03-17 05:40:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:39,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154798105] [2025-03-17 05:40:39,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:39,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:39,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:40:39,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:40:39,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:39,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:40:40,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:40,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154798105] [2025-03-17 05:40:40,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154798105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:40:40,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279528455] [2025-03-17 05:40:40,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:40,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:40:40,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:40:40,031 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:40:40,033 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:40:40,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:40:40,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:40:40,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:40,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:40,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:40:40,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:40:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:40,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:40:40,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279528455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:40,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:40:40,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:40:40,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290496909] [2025-03-17 05:40:40,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:40,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:40:40,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:40,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:40:40,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:40:40,244 INFO L87 Difference]: Start difference. First operand 138 states and 198 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:40,285 INFO L93 Difference]: Finished difference Result 263 states and 376 transitions. [2025-03-17 05:40:40,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:40:40,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-17 05:40:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:40,286 INFO L225 Difference]: With dead ends: 263 [2025-03-17 05:40:40,286 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 05:40:40,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 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:40:40,287 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:40,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 619 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 05:40:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-17 05:40:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 116 states have (on average 1.353448275862069) internal successors, (157), 117 states have internal predecessors, (157), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:40:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 201 transitions. [2025-03-17 05:40:40,303 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 201 transitions. Word has length 141 [2025-03-17 05:40:40,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:40,303 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 201 transitions. [2025-03-17 05:40:40,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:40,303 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 201 transitions. [2025-03-17 05:40:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 05:40:40,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:40,305 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:40,312 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:40:40,510 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,SelfDestructingSolverStorable6 [2025-03-17 05:40:40,510 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:40,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:40,512 INFO L85 PathProgramCache]: Analyzing trace with hash -599006076, now seen corresponding path program 1 times [2025-03-17 05:40:40,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:40,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455482308] [2025-03-17 05:40:40,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:40,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:40:40,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:40:40,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:40,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:40,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:40,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455482308] [2025-03-17 05:40:40,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455482308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:40,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:40,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:40:40,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043590570] [2025-03-17 05:40:40,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:40,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:40:40,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:40,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:40:40,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:40:40,887 INFO L87 Difference]: Start difference. First operand 141 states and 201 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:41,109 INFO L93 Difference]: Finished difference Result 351 states and 496 transitions. [2025-03-17 05:40:41,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:40:41,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 142 [2025-03-17 05:40:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:41,111 INFO L225 Difference]: With dead ends: 351 [2025-03-17 05:40:41,112 INFO L226 Difference]: Without dead ends: 226 [2025-03-17 05:40:41,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:40:41,113 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 288 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:41,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 694 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:40:41,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-17 05:40:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 162. [2025-03-17 05:40:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 137 states have (on average 1.3868613138686132) internal successors, (190), 138 states have internal predecessors, (190), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 05:40:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2025-03-17 05:40:41,128 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 142 [2025-03-17 05:40:41,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:41,128 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2025-03-17 05:40:41,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:41,129 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2025-03-17 05:40:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:40:41,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:41,130 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:41,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:40:41,130 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:41,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:41,130 INFO L85 PathProgramCache]: Analyzing trace with hash -672984610, now seen corresponding path program 1 times [2025-03-17 05:40:41,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:41,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673318716] [2025-03-17 05:40:41,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:41,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:41,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:40:41,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:40:41,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:41,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:41,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:41,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673318716] [2025-03-17 05:40:41,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673318716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:41,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:41,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:40:41,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431540233] [2025-03-17 05:40:41,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:41,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:40:41,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:41,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:40:41,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:40:41,447 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:41,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:41,616 INFO L93 Difference]: Finished difference Result 436 states and 629 transitions. [2025-03-17 05:40:41,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:40:41,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-17 05:40:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:41,618 INFO L225 Difference]: With dead ends: 436 [2025-03-17 05:40:41,618 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 05:40:41,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:40:41,619 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 154 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:41,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 440 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:40:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 05:40:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 231. [2025-03-17 05:40:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 193 states have (on average 1.3678756476683938) internal successors, (264), 193 states have internal predecessors, (264), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:40:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 332 transitions. [2025-03-17 05:40:41,649 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 332 transitions. Word has length 143 [2025-03-17 05:40:41,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:41,650 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 332 transitions. [2025-03-17 05:40:41,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:41,650 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 332 transitions. [2025-03-17 05:40:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:40:41,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:41,652 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:41,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:40:41,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:41,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:41,653 INFO L85 PathProgramCache]: Analyzing trace with hash -260970966, now seen corresponding path program 1 times [2025-03-17 05:40:41,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:41,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947113688] [2025-03-17 05:40:41,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:41,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:41,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:40:41,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:40:41,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:41,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:41,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:41,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947113688] [2025-03-17 05:40:41,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947113688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:41,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:41,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:40:41,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901958495] [2025-03-17 05:40:41,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:41,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:40:41,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:41,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:40:41,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:40:41,911 INFO L87 Difference]: Start difference. First operand 231 states and 332 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:41,981 INFO L93 Difference]: Finished difference Result 499 states and 719 transitions. [2025-03-17 05:40:41,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:40:41,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2025-03-17 05:40:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:41,985 INFO L225 Difference]: With dead ends: 499 [2025-03-17 05:40:41,986 INFO L226 Difference]: Without dead ends: 353 [2025-03-17 05:40:41,987 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:40:41,987 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 67 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:41,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 643 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:41,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-17 05:40:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 316. [2025-03-17 05:40:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 278 states have (on average 1.410071942446043) internal successors, (392), 278 states have internal predecessors, (392), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:40:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 460 transitions. [2025-03-17 05:40:42,008 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 460 transitions. Word has length 147 [2025-03-17 05:40:42,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:42,008 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 460 transitions. [2025-03-17 05:40:42,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 460 transitions. [2025-03-17 05:40:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:40:42,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:42,009 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:42,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:40:42,010 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:42,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:42,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1689329289, now seen corresponding path program 1 times [2025-03-17 05:40:42,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:42,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523709473] [2025-03-17 05:40:42,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:42,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:42,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:40:42,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:40:42,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:42,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:42,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:42,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523709473] [2025-03-17 05:40:42,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523709473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:42,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:42,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:40:42,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290284428] [2025-03-17 05:40:42,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:42,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:40:42,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:42,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:40:42,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:40:42,234 INFO L87 Difference]: Start difference. First operand 316 states and 460 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:42,400 INFO L93 Difference]: Finished difference Result 626 states and 909 transitions. [2025-03-17 05:40:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:40:42,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 147 [2025-03-17 05:40:42,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:42,402 INFO L225 Difference]: With dead ends: 626 [2025-03-17 05:40:42,404 INFO L226 Difference]: Without dead ends: 393 [2025-03-17 05:40:42,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:40:42,405 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 153 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:42,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 731 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:40:42,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-17 05:40:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 315. [2025-03-17 05:40:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 277 states have (on average 1.404332129963899) internal successors, (389), 277 states have internal predecessors, (389), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:40:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 457 transitions. [2025-03-17 05:40:42,433 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 457 transitions. Word has length 147 [2025-03-17 05:40:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:42,434 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 457 transitions. [2025-03-17 05:40:42,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 457 transitions. [2025-03-17 05:40:42,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:40:42,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:42,439 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:42,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:40:42,439 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:42,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:42,440 INFO L85 PathProgramCache]: Analyzing trace with hash -37723334, now seen corresponding path program 1 times [2025-03-17 05:40:42,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:42,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333488591] [2025-03-17 05:40:42,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:42,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:42,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:40:42,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:40:42,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:42,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:43,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:43,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333488591] [2025-03-17 05:40:43,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333488591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:43,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:43,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:40:43,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412398856] [2025-03-17 05:40:43,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:43,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:40:43,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:43,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:40:43,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:40:43,093 INFO L87 Difference]: Start difference. First operand 315 states and 457 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:40:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:43,390 INFO L93 Difference]: Finished difference Result 513 states and 747 transitions. [2025-03-17 05:40:43,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:40:43,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 148 [2025-03-17 05:40:43,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:43,392 INFO L225 Difference]: With dead ends: 513 [2025-03-17 05:40:43,392 INFO L226 Difference]: Without dead ends: 315 [2025-03-17 05:40:43,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:40:43,393 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 240 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:43,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 690 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:40:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-17 05:40:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 241. [2025-03-17 05:40:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 203 states have (on average 1.3645320197044335) internal successors, (277), 203 states have internal predecessors, (277), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 05:40:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 345 transitions. [2025-03-17 05:40:43,412 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 345 transitions. Word has length 148 [2025-03-17 05:40:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:43,413 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 345 transitions. [2025-03-17 05:40:43,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:40:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 345 transitions. [2025-03-17 05:40:43,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:40:43,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:43,414 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:43,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:40:43,414 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:43,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:43,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1867646382, now seen corresponding path program 1 times [2025-03-17 05:40:43,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:43,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840129566] [2025-03-17 05:40:43,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:43,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:43,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:40:43,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:40:43,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:43,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:44,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:44,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840129566] [2025-03-17 05:40:44,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840129566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:44,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:44,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:40:44,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034749569] [2025-03-17 05:40:44,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:44,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:40:44,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:44,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:40:44,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:40:44,582 INFO L87 Difference]: Start difference. First operand 241 states and 345 transitions. Second operand has 11 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 05:40:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:45,038 INFO L93 Difference]: Finished difference Result 503 states and 711 transitions. [2025-03-17 05:40:45,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:40:45,038 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 148 [2025-03-17 05:40:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:45,040 INFO L225 Difference]: With dead ends: 503 [2025-03-17 05:40:45,040 INFO L226 Difference]: Without dead ends: 351 [2025-03-17 05:40:45,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:40:45,041 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 423 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:45,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1080 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:40:45,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-17 05:40:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 348. [2025-03-17 05:40:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 297 states have (on average 1.3468013468013469) internal successors, (400), 298 states have internal predecessors, (400), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 05:40:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 490 transitions. [2025-03-17 05:40:45,077 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 490 transitions. Word has length 148 [2025-03-17 05:40:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:45,078 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 490 transitions. [2025-03-17 05:40:45,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 05:40:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 490 transitions. [2025-03-17 05:40:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:40:45,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:45,080 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:45,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:40:45,080 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:45,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:45,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1252704504, now seen corresponding path program 1 times [2025-03-17 05:40:45,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:45,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387343123] [2025-03-17 05:40:45,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:45,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:45,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:40:45,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:40:45,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:45,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:45,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:45,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387343123] [2025-03-17 05:40:45,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387343123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:45,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:45,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:40:45,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145850609] [2025-03-17 05:40:45,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:45,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:40:45,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:45,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:40:45,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:40:45,287 INFO L87 Difference]: Start difference. First operand 348 states and 490 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:45,366 INFO L93 Difference]: Finished difference Result 740 states and 1039 transitions. [2025-03-17 05:40:45,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:40:45,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2025-03-17 05:40:45,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:45,369 INFO L225 Difference]: With dead ends: 740 [2025-03-17 05:40:45,369 INFO L226 Difference]: Without dead ends: 470 [2025-03-17 05:40:45,370 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:40:45,370 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 172 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:45,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 595 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-17 05:40:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 350. [2025-03-17 05:40:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 299 states have (on average 1.3411371237458194) internal successors, (401), 300 states have internal predecessors, (401), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 05:40:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 491 transitions. [2025-03-17 05:40:45,415 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 491 transitions. Word has length 149 [2025-03-17 05:40:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:45,415 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 491 transitions. [2025-03-17 05:40:45,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:45,415 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 491 transitions. [2025-03-17 05:40:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 05:40:45,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:45,417 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:45,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:40:45,417 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:45,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:45,417 INFO L85 PathProgramCache]: Analyzing trace with hash -680404404, now seen corresponding path program 1 times [2025-03-17 05:40:45,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:45,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366962403] [2025-03-17 05:40:45,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:45,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:45,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:40:45,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:40:45,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:45,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:45,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:45,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366962403] [2025-03-17 05:40:45,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366962403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:45,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:45,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:40:45,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453974254] [2025-03-17 05:40:45,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:45,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:40:45,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:45,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:40:45,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:40:45,500 INFO L87 Difference]: Start difference. First operand 350 states and 491 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:45,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:45,543 INFO L93 Difference]: Finished difference Result 619 states and 870 transitions. [2025-03-17 05:40:45,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:40:45,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-03-17 05:40:45,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:45,545 INFO L225 Difference]: With dead ends: 619 [2025-03-17 05:40:45,545 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 05:40:45,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:40:45,546 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:45,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 05:40:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-17 05:40:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 303 states have (on average 1.3366336633663367) internal successors, (405), 304 states have internal predecessors, (405), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 05:40:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 495 transitions. [2025-03-17 05:40:45,589 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 495 transitions. Word has length 150 [2025-03-17 05:40:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:45,589 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 495 transitions. [2025-03-17 05:40:45,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 495 transitions. [2025-03-17 05:40:45,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 05:40:45,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:45,592 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:45,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:40:45,592 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:45,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:45,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1283337328, now seen corresponding path program 1 times [2025-03-17 05:40:45,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:45,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777320950] [2025-03-17 05:40:45,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:45,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:45,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:40:45,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:40:45,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:45,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:45,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:45,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777320950] [2025-03-17 05:40:45,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777320950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:45,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:45,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:40:45,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445608518] [2025-03-17 05:40:45,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:45,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:40:45,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:45,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:40:45,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:40:45,661 INFO L87 Difference]: Start difference. First operand 354 states and 495 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:45,695 INFO L93 Difference]: Finished difference Result 613 states and 860 transitions. [2025-03-17 05:40:45,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:40:45,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-03-17 05:40:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:45,698 INFO L225 Difference]: With dead ends: 613 [2025-03-17 05:40:45,698 INFO L226 Difference]: Without dead ends: 356 [2025-03-17 05:40:45,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:40:45,700 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:45,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:45,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-17 05:40:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-03-17 05:40:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 305 states have (on average 1.3344262295081968) internal successors, (407), 306 states have internal predecessors, (407), 45 states have call successors, (45), 5 states have call predecessors, (45), 5 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 05:40:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2025-03-17 05:40:45,728 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 150 [2025-03-17 05:40:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:45,728 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2025-03-17 05:40:45,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2025-03-17 05:40:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 05:40:45,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:45,729 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:45,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:40:45,730 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:45,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:45,730 INFO L85 PathProgramCache]: Analyzing trace with hash -125437467, now seen corresponding path program 1 times [2025-03-17 05:40:45,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:45,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094285371] [2025-03-17 05:40:45,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:45,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:45,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:40:45,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:40:45,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:45,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:46,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:46,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094285371] [2025-03-17 05:40:46,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094285371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:46,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:46,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:40:46,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217914658] [2025-03-17 05:40:46,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:46,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:40:46,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:46,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:40:46,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:40:46,430 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 05:40:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:46,743 INFO L93 Difference]: Finished difference Result 372 states and 512 transitions. [2025-03-17 05:40:46,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:40:46,744 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 150 [2025-03-17 05:40:46,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:46,746 INFO L225 Difference]: With dead ends: 372 [2025-03-17 05:40:46,746 INFO L226 Difference]: Without dead ends: 370 [2025-03-17 05:40:46,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:40:46,747 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 211 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:46,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 936 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:40:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-17 05:40:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-03-17 05:40:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 317 states have (on average 1.3217665615141956) internal successors, (419), 318 states have internal predecessors, (419), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 05:40:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 509 transitions. [2025-03-17 05:40:46,783 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 509 transitions. Word has length 150 [2025-03-17 05:40:46,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:46,784 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 509 transitions. [2025-03-17 05:40:46,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 05:40:46,784 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 509 transitions. [2025-03-17 05:40:46,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 05:40:46,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:46,785 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:46,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:40:46,785 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:46,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:46,786 INFO L85 PathProgramCache]: Analyzing trace with hash -124513946, now seen corresponding path program 1 times [2025-03-17 05:40:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:46,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568365724] [2025-03-17 05:40:46,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:46,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:46,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:40:46,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:40:46,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:46,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:40:47,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:47,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568365724] [2025-03-17 05:40:47,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568365724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:40:47,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142943677] [2025-03-17 05:40:47,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:47,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:40:47,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:40:47,597 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:40:47,599 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:40:47,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:40:47,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:40:47,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:47,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:47,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 05:40:47,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:40:48,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 05:40:48,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 05:40:49,025 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:40:49,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:40:49,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:40:49,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:40:49,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:40:49,677 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-17 05:40:49,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2025-03-17 05:40:49,768 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:40:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 57 proven. 350 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-17 05:40:49,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:40:49,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142943677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:40:49,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:40:49,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2025-03-17 05:40:49,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205075249] [2025-03-17 05:40:49,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:40:49,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 05:40:49,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:49,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 05:40:49,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:40:49,917 INFO L87 Difference]: Start difference. First operand 370 states and 509 transitions. Second operand has 22 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 22 states have internal predecessors, (118), 12 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (34), 9 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-17 05:40:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:51,317 INFO L93 Difference]: Finished difference Result 974 states and 1325 transitions. [2025-03-17 05:40:51,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:40:51,317 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 22 states have internal predecessors, (118), 12 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (34), 9 states have call predecessors, (34), 12 states have call successors, (34) Word has length 150 [2025-03-17 05:40:51,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:51,320 INFO L225 Difference]: With dead ends: 974 [2025-03-17 05:40:51,320 INFO L226 Difference]: Without dead ends: 687 [2025-03-17 05:40:51,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 05:40:51,321 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 573 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:51,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 1774 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 05:40:51,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-17 05:40:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 659. [2025-03-17 05:40:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 570 states have (on average 1.3192982456140352) internal successors, (752), 572 states have internal predecessors, (752), 73 states have call successors, (73), 15 states have call predecessors, (73), 15 states have return successors, (73), 71 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-17 05:40:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 898 transitions. [2025-03-17 05:40:51,368 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 898 transitions. Word has length 150 [2025-03-17 05:40:51,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:51,368 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 898 transitions. [2025-03-17 05:40:51,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.2105263157894735) internal successors, (118), 22 states have internal predecessors, (118), 12 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (34), 9 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-17 05:40:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 898 transitions. [2025-03-17 05:40:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:40:51,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:51,370 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:51,380 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:40:51,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 05:40:51,575 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:51,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:51,575 INFO L85 PathProgramCache]: Analyzing trace with hash -26279098, now seen corresponding path program 1 times [2025-03-17 05:40:51,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:51,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516573545] [2025-03-17 05:40:51,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:51,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:40:51,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:40:51,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:51,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:51,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:51,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516573545] [2025-03-17 05:40:51,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516573545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:51,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:51,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:40:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933252810] [2025-03-17 05:40:51,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:51,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:40:51,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:51,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:40:51,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:40:51,772 INFO L87 Difference]: Start difference. First operand 659 states and 898 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:51,869 INFO L93 Difference]: Finished difference Result 1063 states and 1452 transitions. [2025-03-17 05:40:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:40:51,870 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2025-03-17 05:40:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:51,873 INFO L225 Difference]: With dead ends: 1063 [2025-03-17 05:40:51,873 INFO L226 Difference]: Without dead ends: 790 [2025-03-17 05:40:51,874 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:40:51,874 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 146 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:51,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 565 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-03-17 05:40:51,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 687. [2025-03-17 05:40:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 598 states have (on average 1.326086956521739) internal successors, (793), 600 states have internal predecessors, (793), 73 states have call successors, (73), 15 states have call predecessors, (73), 15 states have return successors, (73), 71 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-17 05:40:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 939 transitions. [2025-03-17 05:40:51,923 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 939 transitions. Word has length 151 [2025-03-17 05:40:51,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:51,924 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 939 transitions. [2025-03-17 05:40:51,924 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 939 transitions. [2025-03-17 05:40:51,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:40:51,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:51,926 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:51,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:40:51,926 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:51,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:51,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2064335387, now seen corresponding path program 1 times [2025-03-17 05:40:51,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:51,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129715261] [2025-03-17 05:40:51,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:51,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:51,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:40:51,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:40:51,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:51,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:52,104 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:52,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:52,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129715261] [2025-03-17 05:40:52,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129715261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:52,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:52,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:40:52,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780522795] [2025-03-17 05:40:52,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:52,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:40:52,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:52,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:40:52,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:40:52,106 INFO L87 Difference]: Start difference. First operand 687 states and 939 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:52,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:52,283 INFO L93 Difference]: Finished difference Result 1481 states and 2015 transitions. [2025-03-17 05:40:52,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:40:52,283 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2025-03-17 05:40:52,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:52,287 INFO L225 Difference]: With dead ends: 1481 [2025-03-17 05:40:52,287 INFO L226 Difference]: Without dead ends: 913 [2025-03-17 05:40:52,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:40:52,288 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 231 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:52,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 757 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:40:52,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-03-17 05:40:52,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 705. [2025-03-17 05:40:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 616 states have (on average 1.3165584415584415) internal successors, (811), 618 states have internal predecessors, (811), 73 states have call successors, (73), 15 states have call predecessors, (73), 15 states have return successors, (73), 71 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-17 05:40:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 957 transitions. [2025-03-17 05:40:52,344 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 957 transitions. Word has length 151 [2025-03-17 05:40:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:52,344 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 957 transitions. [2025-03-17 05:40:52,344 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 957 transitions. [2025-03-17 05:40:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:40:52,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:52,346 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:52,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:40:52,346 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:52,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:52,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1684737256, now seen corresponding path program 1 times [2025-03-17 05:40:52,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:52,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115514969] [2025-03-17 05:40:52,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:52,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:52,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:40:52,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:40:52,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:52,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:52,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:52,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115514969] [2025-03-17 05:40:52,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115514969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:52,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:52,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:40:52,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457321854] [2025-03-17 05:40:52,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:52,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:40:52,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:52,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:40:52,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:40:52,521 INFO L87 Difference]: Start difference. First operand 705 states and 957 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:52,607 INFO L93 Difference]: Finished difference Result 1160 states and 1569 transitions. [2025-03-17 05:40:52,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:40:52,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2025-03-17 05:40:52,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:52,611 INFO L225 Difference]: With dead ends: 1160 [2025-03-17 05:40:52,611 INFO L226 Difference]: Without dead ends: 833 [2025-03-17 05:40:52,612 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:40:52,612 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 152 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 448 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:40:52,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 448 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:40:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-03-17 05:40:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 677. [2025-03-17 05:40:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 588 states have (on average 1.3129251700680271) internal successors, (772), 590 states have internal predecessors, (772), 73 states have call successors, (73), 15 states have call predecessors, (73), 15 states have return successors, (73), 71 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-17 05:40:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 918 transitions. [2025-03-17 05:40:52,666 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 918 transitions. Word has length 152 [2025-03-17 05:40:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:52,666 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 918 transitions. [2025-03-17 05:40:52,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 918 transitions. [2025-03-17 05:40:52,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:40:52,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:52,668 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:52,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:40:52,669 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:52,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:52,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1311880728, now seen corresponding path program 1 times [2025-03-17 05:40:52,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:52,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251407290] [2025-03-17 05:40:52,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:52,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:52,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:40:52,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:40:52,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:52,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:53,549 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:53,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:53,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251407290] [2025-03-17 05:40:53,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251407290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:53,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:53,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:40:53,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594249519] [2025-03-17 05:40:53,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:53,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:40:53,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:53,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:40:53,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:40:53,551 INFO L87 Difference]: Start difference. First operand 677 states and 918 transitions. Second operand has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-17 05:40:54,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:54,331 INFO L93 Difference]: Finished difference Result 1514 states and 2050 transitions. [2025-03-17 05:40:54,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:40:54,331 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 152 [2025-03-17 05:40:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:54,335 INFO L225 Difference]: With dead ends: 1514 [2025-03-17 05:40:54,335 INFO L226 Difference]: Without dead ends: 948 [2025-03-17 05:40:54,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:40:54,337 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 476 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:54,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1141 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:40:54,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-03-17 05:40:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 807. [2025-03-17 05:40:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 717 states have (on average 1.3263598326359833) internal successors, (951), 719 states have internal predecessors, (951), 73 states have call successors, (73), 16 states have call predecessors, (73), 16 states have return successors, (73), 71 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-17 05:40:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1097 transitions. [2025-03-17 05:40:54,396 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1097 transitions. Word has length 152 [2025-03-17 05:40:54,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:54,396 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1097 transitions. [2025-03-17 05:40:54,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.833333333333333) internal successors, (70), 13 states have internal predecessors, (70), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-17 05:40:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1097 transitions. [2025-03-17 05:40:54,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:40:54,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:54,397 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:54,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:40:54,398 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:54,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:54,398 INFO L85 PathProgramCache]: Analyzing trace with hash 413600169, now seen corresponding path program 1 times [2025-03-17 05:40:54,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:54,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837029643] [2025-03-17 05:40:54,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:54,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:54,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:40:54,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:40:54,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:54,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:54,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:54,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837029643] [2025-03-17 05:40:54,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837029643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:54,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:54,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:40:54,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602915899] [2025-03-17 05:40:54,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:54,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:40:54,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:54,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:40:54,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:40:54,694 INFO L87 Difference]: Start difference. First operand 807 states and 1097 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:40:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:54,925 INFO L93 Difference]: Finished difference Result 1320 states and 1800 transitions. [2025-03-17 05:40:54,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:40:54,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 152 [2025-03-17 05:40:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:54,928 INFO L225 Difference]: With dead ends: 1320 [2025-03-17 05:40:54,928 INFO L226 Difference]: Without dead ends: 628 [2025-03-17 05:40:54,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:40:54,932 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 353 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:54,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 498 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:40:54,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-03-17 05:40:54,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 618. [2025-03-17 05:40:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 541 states have (on average 1.3123844731977818) internal successors, (710), 542 states have internal predecessors, (710), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:40:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 834 transitions. [2025-03-17 05:40:54,981 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 834 transitions. Word has length 152 [2025-03-17 05:40:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:54,982 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 834 transitions. [2025-03-17 05:40:54,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:40:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 834 transitions. [2025-03-17 05:40:54,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:40:54,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:54,983 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:54,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:40:54,983 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:54,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1956857784, now seen corresponding path program 1 times [2025-03-17 05:40:54,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:54,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372455871] [2025-03-17 05:40:54,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:54,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:40:55,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:40:55,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:55,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:55,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:55,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372455871] [2025-03-17 05:40:55,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372455871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:40:55,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:40:55,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:40:55,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534145105] [2025-03-17 05:40:55,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:55,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:40:55,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:55,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:40:55,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:40:55,198 INFO L87 Difference]: Start difference. First operand 618 states and 834 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:40:55,329 INFO L93 Difference]: Finished difference Result 1292 states and 1756 transitions. [2025-03-17 05:40:55,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:40:55,329 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-17 05:40:55,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:40:55,334 INFO L225 Difference]: With dead ends: 1292 [2025-03-17 05:40:55,334 INFO L226 Difference]: Without dead ends: 789 [2025-03-17 05:40:55,335 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:40:55,336 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 67 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:40:55,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 700 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:40:55,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-17 05:40:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 690. [2025-03-17 05:40:55,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 613 states have (on average 1.3181076672104404) internal successors, (808), 614 states have internal predecessors, (808), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:40:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 932 transitions. [2025-03-17 05:40:55,399 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 932 transitions. Word has length 154 [2025-03-17 05:40:55,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:40:55,400 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 932 transitions. [2025-03-17 05:40:55,400 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:40:55,400 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 932 transitions. [2025-03-17 05:40:55,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:40:55,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:40:55,403 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:55,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:40:55,403 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:40:55,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:40:55,404 INFO L85 PathProgramCache]: Analyzing trace with hash -81198505, now seen corresponding path program 1 times [2025-03-17 05:40:55,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:40:55,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778692789] [2025-03-17 05:40:55,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:40:55,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:40:55,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:40:55,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:55,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:40:57,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:40:57,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778692789] [2025-03-17 05:40:57,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778692789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:40:57,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164157515] [2025-03-17 05:40:57,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:40:57,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:40:57,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:40:57,415 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:40:57,416 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:40:57,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:40:57,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:40:57,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:40:57,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:40:57,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 05:40:57,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:40:58,288 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:40:58,851 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:40:58,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 43 [2025-03-17 05:40:58,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:40:58,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2025-03-17 05:40:58,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:40:58,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2025-03-17 05:40:59,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:40:59,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 65 [2025-03-17 05:40:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 309 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-17 05:40:59,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:40:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:40:59,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164157515] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:40:59,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:40:59,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [25, 13] total 37 [2025-03-17 05:40:59,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876970914] [2025-03-17 05:40:59,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:40:59,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:40:59,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:40:59,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:40:59,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1231, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 05:40:59,761 INFO L87 Difference]: Start difference. First operand 690 states and 932 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:00,192 INFO L93 Difference]: Finished difference Result 1312 states and 1786 transitions. [2025-03-17 05:41:00,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:41:00,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-17 05:41:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:00,195 INFO L225 Difference]: With dead ends: 1312 [2025-03-17 05:41:00,195 INFO L226 Difference]: Without dead ends: 974 [2025-03-17 05:41:00,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 298 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=123, Invalid=1599, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 05:41:00,196 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 94 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:00,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1500 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:41:00,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-17 05:41:00,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 843. [2025-03-17 05:41:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 766 states have (on average 1.335509138381201) internal successors, (1023), 767 states have internal predecessors, (1023), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:41:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1147 transitions. [2025-03-17 05:41:00,243 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1147 transitions. Word has length 154 [2025-03-17 05:41:00,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:00,244 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1147 transitions. [2025-03-17 05:41:00,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:00,245 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1147 transitions. [2025-03-17 05:41:00,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:41:00,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:00,246 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:00,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:41:00,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:41:00,447 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:00,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:00,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1272111192, now seen corresponding path program 1 times [2025-03-17 05:41:00,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:00,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746672301] [2025-03-17 05:41:00,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:00,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:00,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:41:00,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:41:00,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:00,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:01,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:01,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746672301] [2025-03-17 05:41:01,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746672301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:01,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:01,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:41:01,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739826947] [2025-03-17 05:41:01,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:01,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:41:01,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:01,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:41:01,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:41:01,111 INFO L87 Difference]: Start difference. First operand 843 states and 1147 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:41:01,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:01,521 INFO L93 Difference]: Finished difference Result 1401 states and 1921 transitions. [2025-03-17 05:41:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:41:01,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 154 [2025-03-17 05:41:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:01,524 INFO L225 Difference]: With dead ends: 1401 [2025-03-17 05:41:01,524 INFO L226 Difference]: Without dead ends: 960 [2025-03-17 05:41:01,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:41:01,526 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 244 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:01,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 737 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:41:01,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-03-17 05:41:01,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 843. [2025-03-17 05:41:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 766 states have (on average 1.3328981723237598) internal successors, (1021), 767 states have internal predecessors, (1021), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:41:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1145 transitions. [2025-03-17 05:41:01,587 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1145 transitions. Word has length 154 [2025-03-17 05:41:01,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:01,587 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1145 transitions. [2025-03-17 05:41:01,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:41:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1145 transitions. [2025-03-17 05:41:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:41:01,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:01,588 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:01,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:41:01,589 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:01,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:01,590 INFO L85 PathProgramCache]: Analyzing trace with hash 248567256, now seen corresponding path program 1 times [2025-03-17 05:41:01,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:01,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165596] [2025-03-17 05:41:01,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:01,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:01,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:41:01,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:41:01,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:01,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:02,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:02,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165596] [2025-03-17 05:41:02,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:02,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:02,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:41:02,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964415770] [2025-03-17 05:41:02,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:02,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:41:02,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:02,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:41:02,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:41:02,219 INFO L87 Difference]: Start difference. First operand 843 states and 1145 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:41:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:02,542 INFO L93 Difference]: Finished difference Result 1455 states and 1994 transitions. [2025-03-17 05:41:02,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:41:02,542 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 154 [2025-03-17 05:41:02,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:02,546 INFO L225 Difference]: With dead ends: 1455 [2025-03-17 05:41:02,546 INFO L226 Difference]: Without dead ends: 1014 [2025-03-17 05:41:02,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:41:02,547 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 340 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:02,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 544 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:41:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-03-17 05:41:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 889. [2025-03-17 05:41:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 811 states have (on average 1.339087546239211) internal successors, (1086), 812 states have internal predecessors, (1086), 62 states have call successors, (62), 15 states have call predecessors, (62), 15 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:41:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1210 transitions. [2025-03-17 05:41:02,615 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1210 transitions. Word has length 154 [2025-03-17 05:41:02,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:02,615 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1210 transitions. [2025-03-17 05:41:02,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 05:41:02,615 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1210 transitions. [2025-03-17 05:41:02,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:41:02,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:02,616 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:02,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:41:02,616 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:02,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:02,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1601876953, now seen corresponding path program 1 times [2025-03-17 05:41:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:02,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13169392] [2025-03-17 05:41:02,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:02,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:41:02,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:41:02,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:02,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:03,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:03,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13169392] [2025-03-17 05:41:03,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13169392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:03,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:03,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:41:03,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895770006] [2025-03-17 05:41:03,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:03,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:41:03,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:03,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:41:03,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:41:03,974 INFO L87 Difference]: Start difference. First operand 889 states and 1210 transitions. Second operand has 15 states, 14 states have (on average 5.142857142857143) internal successors, (72), 15 states have internal predecessors, (72), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-17 05:41:04,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:04,627 INFO L93 Difference]: Finished difference Result 1503 states and 2060 transitions. [2025-03-17 05:41:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:41:04,628 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 5.142857142857143) internal successors, (72), 15 states have internal predecessors, (72), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) Word has length 154 [2025-03-17 05:41:04,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:04,631 INFO L225 Difference]: With dead ends: 1503 [2025-03-17 05:41:04,631 INFO L226 Difference]: Without dead ends: 1020 [2025-03-17 05:41:04,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:41:04,632 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 465 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:04,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1499 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:41:04,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2025-03-17 05:41:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 889. [2025-03-17 05:41:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 811 states have (on average 1.339087546239211) internal successors, (1086), 812 states have internal predecessors, (1086), 62 states have call successors, (62), 15 states have call predecessors, (62), 15 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:41:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1210 transitions. [2025-03-17 05:41:04,688 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1210 transitions. Word has length 154 [2025-03-17 05:41:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:04,688 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1210 transitions. [2025-03-17 05:41:04,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 5.142857142857143) internal successors, (72), 15 states have internal predecessors, (72), 5 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 4 states have call predecessors, (17), 5 states have call successors, (17) [2025-03-17 05:41:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1210 transitions. [2025-03-17 05:41:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:41:04,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:04,689 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:04,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:41:04,690 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:04,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1152864304, now seen corresponding path program 1 times [2025-03-17 05:41:04,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:04,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757702795] [2025-03-17 05:41:04,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:04,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:04,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:41:04,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:41:04,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:04,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:05,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:05,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757702795] [2025-03-17 05:41:05,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757702795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:05,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:05,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:41:05,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869402044] [2025-03-17 05:41:05,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:05,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:41:05,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:05,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:41:05,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:41:05,122 INFO L87 Difference]: Start difference. First operand 889 states and 1210 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:05,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:05,577 INFO L93 Difference]: Finished difference Result 2031 states and 2769 transitions. [2025-03-17 05:41:05,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:41:05,577 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-17 05:41:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:05,581 INFO L225 Difference]: With dead ends: 2031 [2025-03-17 05:41:05,581 INFO L226 Difference]: Without dead ends: 1340 [2025-03-17 05:41:05,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:41:05,582 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 648 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:05,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 929 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:41:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2025-03-17 05:41:05,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1054. [2025-03-17 05:41:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 976 states have (on average 1.341188524590164) internal successors, (1309), 977 states have internal predecessors, (1309), 62 states have call successors, (62), 15 states have call predecessors, (62), 15 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:41:05,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1433 transitions. [2025-03-17 05:41:05,675 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1433 transitions. Word has length 154 [2025-03-17 05:41:05,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:05,675 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1433 transitions. [2025-03-17 05:41:05,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:05,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1433 transitions. [2025-03-17 05:41:05,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:41:05,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:05,676 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:05,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 05:41:05,676 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:05,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:05,676 INFO L85 PathProgramCache]: Analyzing trace with hash 734265040, now seen corresponding path program 1 times [2025-03-17 05:41:05,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:05,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42716717] [2025-03-17 05:41:05,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:05,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:05,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:41:05,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:41:05,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:05,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:05,827 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:05,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:41:05,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42716717] [2025-03-17 05:41:05,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42716717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:05,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:05,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:41:05,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462310117] [2025-03-17 05:41:05,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:05,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:41:05,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:41:05,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:41:05,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:41:05,829 INFO L87 Difference]: Start difference. First operand 1054 states and 1433 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:05,975 INFO L93 Difference]: Finished difference Result 1978 states and 2712 transitions. [2025-03-17 05:41:05,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:41:05,976 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 154 [2025-03-17 05:41:05,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:05,980 INFO L225 Difference]: With dead ends: 1978 [2025-03-17 05:41:05,980 INFO L226 Difference]: Without dead ends: 1152 [2025-03-17 05:41:05,982 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:41:05,982 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 127 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:05,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 459 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:41:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2025-03-17 05:41:06,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1054. [2025-03-17 05:41:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1054 states, 976 states have (on average 1.339139344262295) internal successors, (1307), 977 states have internal predecessors, (1307), 62 states have call successors, (62), 15 states have call predecessors, (62), 15 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 05:41:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1431 transitions. [2025-03-17 05:41:06,043 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1431 transitions. Word has length 154 [2025-03-17 05:41:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:06,043 INFO L471 AbstractCegarLoop]: Abstraction has 1054 states and 1431 transitions. [2025-03-17 05:41:06,043 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:06,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1431 transitions. [2025-03-17 05:41:06,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:41:06,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:06,045 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:06,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 05:41:06,045 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:06,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2128738998, now seen corresponding path program 1 times [2025-03-17 05:41:06,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:41:06,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211643657] [2025-03-17 05:41:06,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:06,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:41:06,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:41:06,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:41:06,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:06,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:41:06,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:41:06,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:41:06,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:41:06,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:06,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:41:06,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:41:06,266 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:41:06,266 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:41:06,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 05:41:06,270 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 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:41:06,428 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:41:06,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:41:06 BoogieIcfgContainer [2025-03-17 05:41:06,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:41:06,433 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:41:06,433 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:41:06,433 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:41:06,434 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:40:36" (3/4) ... [2025-03-17 05:41:06,436 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:41:06,437 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:41:06,437 INFO L158 Benchmark]: Toolchain (without parser) took 31390.93ms. Allocated memory was 167.8MB in the beginning and 729.8MB in the end (delta: 562.0MB). Free memory was 129.4MB in the beginning and 622.5MB in the end (delta: -493.1MB). Peak memory consumption was 69.1MB. Max. memory is 16.1GB. [2025-03-17 05:41:06,438 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:41:06,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.93ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 113.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:41:06,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.92ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 109.8MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:41:06,439 INFO L158 Benchmark]: Boogie Preprocessor took 49.20ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 106.3MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:41:06,439 INFO L158 Benchmark]: IcfgBuilder took 644.47ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 67.0MB in the end (delta: 39.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:41:06,439 INFO L158 Benchmark]: TraceAbstraction took 30381.69ms. Allocated memory was 167.8MB in the beginning and 729.8MB in the end (delta: 562.0MB). Free memory was 66.0MB in the beginning and 622.7MB in the end (delta: -556.7MB). Peak memory consumption was 371.1MB. Max. memory is 16.1GB. [2025-03-17 05:41:06,440 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 729.8MB. Free memory was 622.7MB in the beginning and 622.5MB in the end (delta: 235.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:41:06,440 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.74ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.93ms. Allocated memory is still 167.8MB. Free memory was 128.5MB in the beginning and 113.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.92ms. Allocated memory is still 167.8MB. Free memory was 113.1MB in the beginning and 109.8MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.20ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 106.3MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 644.47ms. Allocated memory is still 167.8MB. Free memory was 106.3MB in the beginning and 67.0MB in the end (delta: 39.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30381.69ms. Allocated memory was 167.8MB in the beginning and 729.8MB in the end (delta: 562.0MB). Free memory was 66.0MB in the beginning and 622.7MB in the end (delta: -556.7MB). Peak memory consumption was 371.1MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 729.8MB. Free memory was 622.7MB in the beginning and 622.5MB in the end (delta: 235.4kB). 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 98, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of bitwiseOr at line 65, overapproximation of bitwiseOr at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27-L29] float float_Array_0[2] = { 1000000.5, 4.5 }; [L27-L29] float float_Array_0[2] = { 1000000.5, 4.5 }; [L27-L29] float float_Array_0[2] = { 1000000.5, 4.5 }; [L30] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L31] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L32-L34] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L32-L34] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L32-L34] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L32-L34] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L32-L34] signed char signed_char_Array_0[2][2] = { {100, -1}, {-50, -8} }; [L35] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0][0]); [L36] signed char* signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer = &(signed_char_Array_0[1][0]); [L37] signed char* signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer = &(signed_char_Array_0[0][1]); [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer = &(signed_char_Array_0[1][1]); [L39-L41] signed long int signed_long_int_Array_0[1] = { 64 }; [L39-L41] signed long int signed_long_int_Array_0[1] = { 64 }; [L42] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L43-L45] signed short int signed_short_int_Array_0[1] = { -16 }; [L43-L45] signed short int signed_short_int_Array_0[1] = { -16 }; [L46] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L47-L49] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L47-L49] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L47-L49] unsigned char unsigned_char_Array_0[2] = { 0, 128 }; [L50] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L51] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L52-L54] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L52-L54] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L52-L54] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L52-L54] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L52-L54] unsigned long int unsigned_long_int_Array_0[2][2] = { {1191097264, 25}, {1801344522, 2568920345} }; [L55] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer = &(unsigned_long_int_Array_0[0][0]); [L56] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer = &(unsigned_long_int_Array_0[1][0]); [L57] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer = &(unsigned_long_int_Array_0[0][1]); [L58] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer = &(unsigned_long_int_Array_0[1][1]); [L59] signed short int last_1_signed_short_int_Array_0_0_ = -16; [L60] unsigned char last_1_unsigned_char_Array_0_0_ = 0; [L61] unsigned long int last_1_unsigned_long_int_Array_0_0__1_ = 25; [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L119] EXPR signed_short_int_Array_0[0] [L119] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L120] EXPR unsigned_char_Array_0[0] [L120] last_1_unsigned_char_Array_0_0_ = unsigned_char_Array_0[0] [L121] EXPR unsigned_long_int_Array_0[0][1] [L121] last_1_unsigned_long_int_Array_0_0__1_ = unsigned_long_int_Array_0[0][1] [L131] RET updateLastVariables() [L132] CALL updateVariables() [L91] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L92] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L92] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L92] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L93] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L93] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L93] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L94] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L95] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L95] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L95] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L96] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L96] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L96] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L97] float_Array_0[1] = __VERIFIER_nondet_float() [L98] EXPR float_Array_0[1] [L98] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L98] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L98] EXPR float_Array_0[1] [L98] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L98] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L98] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L98] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L98] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L99] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L100] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L100] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L100] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L101] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L101] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L101] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L102] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L103] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L103] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L103] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L104] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L104] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L104] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L105] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L106] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L106] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L106] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L107] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L107] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L107] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L108] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L109] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L109] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L109] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L110] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L110] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L110] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L111] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L112] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L112] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L112] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L113] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L113] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L113] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L114] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L115] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L115] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L115] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L116] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L116] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L116] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L132] RET updateVariables() [L133] CALL step() [L65] EXPR last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_ VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L65] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L65] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L65] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L65] ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L65] COND FALSE !(((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) [L72] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L72] (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) = (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)) [L74] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L74] COND FALSE !((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) [L77] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) [L77] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L77] COND TRUE (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) [L78] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L78] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) [L78] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L78] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L78] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) = (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) [L80] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) = 2 [L81] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L81] (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) [L82] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L82] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) [L83] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L83] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer) [L83] unsigned char stepLocal_0 = (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)); [L84] stepLocal_0 && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L84] stepLocal_0 && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L84] COND FALSE !(stepLocal_0 && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) [L87] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer) [L87] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer) [L87] (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) = ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))) [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_ VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L124] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L124] EXPR ((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) [L124] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer) [L124] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer) [L124] EXPR (((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1) [L124] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1 [L124] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))))) [L124] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L124] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer) [L124] EXPR ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) [L124] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer) [L124] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer) [L124] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer) [L124] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1) [L124] EXPR \read(*unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer) [L124] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1 [L124] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L124] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) [L124] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer) [L124] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2)) [L124] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L124] EXPR (((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) [L124] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar0_Pointer) [L124] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L124] EXPR ((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124] EXPR (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L124-L125] return (((((((((last_1_signed_short_int_Array_0_0_ | last_1_unsigned_long_int_Array_0_0__1_) > last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer)) == ((signed char) (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) == ((signed char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))))) : 1)) && ((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)) < (*(signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer))) && ((((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) > ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer)))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))) == (*(signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - ((((((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) > ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer)))) ? ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))) - 1u)))) : ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer)) == ((unsigned long int) ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer)) - (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer))))))) && (((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) <= (*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) < 0 ) ? -((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer))))))) : 1)) && ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) 2))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, isInitial=1, last_1_signed_short_int_Array_0_0_=-16, last_1_unsigned_char_Array_0_0_=0, last_1_unsigned_long_int_Array_0_0__1_=25, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var1_Pointer={6:2}, signed_char_Array_0_arraysigned_char_Array_0Var2_Pointer={6:1}, signed_char_Array_0_arraysigned_char_Array_0Var3_Pointer={6:3}, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0={8:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={9:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={9:1}, unsigned_long_int_Array_0={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={10:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var1_Pointer={10:8}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var2_Pointer={10:4}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var3_Pointer={10:12}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 185 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.2s, OverallIterations: 31, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6430 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6424 mSDsluCounter, 21296 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16083 mSDsCounter, 923 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6689 IncrementalHoareTripleChecker+Invalid, 7612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 923 mSolverCounterUnsat, 5213 mSDtfsCounter, 6689 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1130 GetRequests, 850 SyntacticMatches, 2 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1054occurred in iteration=29, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 2154 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 5175 NumberOfCodeBlocks, 5175 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 5140 ConstructedInterpolants, 4 QuantifiedInterpolants, 35671 SizeOfPredicates, 29 NumberOfNonLiveVariables, 2360 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 35 InterpolantComputations, 29 PerfectInterpolantSequences, 18277/19040 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:41:06,464 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-ap_file-88.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 9f13b6ec153b424c9c18800ebe21aa9579fe753fb31fef85cd6c1089c45b899c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:41:08,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:41:08,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:41:08,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:41:08,429 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:41:08,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:41:08,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:41:08,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:41:08,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:41:08,449 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:41:08,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:41:08,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:41:08,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:41:08,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:41:08,449 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:41:08,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:41:08,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:41:08,450 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:41:08,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:41:08,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:41:08,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:41:08,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:41:08,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:41:08,450 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:41:08,450 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:41:08,450 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:41:08,450 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:41:08,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:41:08,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:41:08,451 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:41:08,451 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:41:08,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:41:08,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:41:08,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:41:08,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:41:08,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:41:08,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:41:08,451 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:41:08,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:41:08,451 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:41:08,452 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:41:08,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:41:08,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:41:08,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:41:08,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:41:08,452 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 -> 9f13b6ec153b424c9c18800ebe21aa9579fe753fb31fef85cd6c1089c45b899c [2025-03-17 05:41:08,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:41:08,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:41:08,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:41:08,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:41:08,706 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:41:08,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-88.i [2025-03-17 05:41:09,871 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda9e0d6c/b57f033765f1492592e120a47f3ec486/FLAG02a65ac4a [2025-03-17 05:41:10,101 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:41:10,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-88.i [2025-03-17 05:41:10,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda9e0d6c/b57f033765f1492592e120a47f3ec486/FLAG02a65ac4a [2025-03-17 05:41:10,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda9e0d6c/b57f033765f1492592e120a47f3ec486 [2025-03-17 05:41:10,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:41:10,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:41:10,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:41:10,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:41:10,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:41:10,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:41:10" (1/1) ... [2025-03-17 05:41:10,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e4bbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:10, skipping insertion in model container [2025-03-17 05:41:10,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:41:10" (1/1) ... [2025-03-17 05:41:10,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:41:10,246 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-ap_file-88.i[917,930] [2025-03-17 05:41:10,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:41:10,323 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:41:10,332 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-ap_file-88.i[917,930] [2025-03-17 05:41:10,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:41:10,372 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:41:10,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:10 WrapperNode [2025-03-17 05:41:10,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:41:10,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:41:10,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:41:10,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:41:10,378 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:41:10" (1/1) ... [2025-03-17 05:41:10,395 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:41:10" (1/1) ... [2025-03-17 05:41:10,437 INFO L138 Inliner]: procedures = 36, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2025-03-17 05:41:10,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:41:10,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:41:10,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:41:10,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:41:10,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:10" (1/1) ... [2025-03-17 05:41:10,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:10" (1/1) ... [2025-03-17 05:41:10,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:10" (1/1) ... [2025-03-17 05:41:10,495 INFO L175 MemorySlicer]: Split 134 memory accesses to 8 slices as follows [2, 16, 11, 54, 3, 4, 10, 34]. 40 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 4, 1, 1, 2, 4]. The 19 writes are split as follows [0, 2, 2, 6, 1, 1, 2, 5]. [2025-03-17 05:41:10,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:10" (1/1) ... [2025-03-17 05:41:10,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:10" (1/1) ... [2025-03-17 05:41:10,516 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:10" (1/1) ... [2025-03-17 05:41:10,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:10" (1/1) ... [2025-03-17 05:41:10,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:10" (1/1) ... [2025-03-17 05:41:10,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:10" (1/1) ... [2025-03-17 05:41:10,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:41:10,541 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:41:10,541 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:41:10,541 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:41:10,542 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:10" (1/1) ... [2025-03-17 05:41:10,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:41:10,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:41:10,568 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:41:10,573 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:41:10,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:41:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:41:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:41:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:41:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:41:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:41:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:41:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:41:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-17 05:41:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:41:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:41:10,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:41:10,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:41:10,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:41:10,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:41:10,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-17 05:41:10,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-17 05:41:10,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:41:10,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:41:10,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:41:10,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:41:10,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:41:10,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:41:10,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:41:10,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-17 05:41:10,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:41:10,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:41:10,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:41:10,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:41:10,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:41:10,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:41:10,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:41:10,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-17 05:41:10,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:41:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:41:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:41:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:41:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:41:10,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:41:10,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:41:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-17 05:41:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-17 05:41:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:41:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:41:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:41:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:41:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:41:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:41:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-17 05:41:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-17 05:41:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:41:10,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:41:10,597 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:41:10,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:41:10,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:41:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:41:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:41:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:41:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:41:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:41:10,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-17 05:41:10,746 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:41:10,748 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:41:11,238 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~mem78#1;havoc property_#t~short79#1;havoc property_#t~ite90#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~short82#1;havoc property_#t~ite87#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~ite98#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short99#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem107#1;havoc property_#t~short108#1;havoc property_#t~ite119#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite113#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem123#1;havoc property_#t~ite126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short129#1;havoc property_#t~mem130#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1; [2025-03-17 05:41:11,277 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-03-17 05:41:11,277 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:41:11,287 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:41:11,288 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:41:11,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:41:11 BoogieIcfgContainer [2025-03-17 05:41:11,288 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:41:11,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:41:11,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:41:11,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:41:11,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:41:10" (1/3) ... [2025-03-17 05:41:11,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2ddb4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:41:11, skipping insertion in model container [2025-03-17 05:41:11,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:41:10" (2/3) ... [2025-03-17 05:41:11,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2ddb4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:41:11, skipping insertion in model container [2025-03-17 05:41:11,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:41:11" (3/3) ... [2025-03-17 05:41:11,296 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-88.i [2025-03-17 05:41:11,307 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:41:11,309 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-88.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:41:11,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:41:11,367 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;@469c1f78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:41:11,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:41:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:41:11,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:41:11,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:11,383 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:11,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:11,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:11,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2011569242, now seen corresponding path program 1 times [2025-03-17 05:41:11,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:11,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662187668] [2025-03-17 05:41:11,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:11,400 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:41:11,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:11,403 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:41:11,405 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:41:11,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:41:11,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:41:11,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:11,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:11,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:41:11,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-03-17 05:41:11,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:41:11,752 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:11,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662187668] [2025-03-17 05:41:11,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662187668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:11,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:11,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:41:11,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289415773] [2025-03-17 05:41:11,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:11,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:41:11,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:11,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:41:11,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:41:11,779 INFO L87 Difference]: Start difference. First operand has 105 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:41:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:11,797 INFO L93 Difference]: Finished difference Result 207 states and 327 transitions. [2025-03-17 05:41:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:41:11,799 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-03-17 05:41:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:11,803 INFO L225 Difference]: With dead ends: 207 [2025-03-17 05:41:11,803 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 05:41:11,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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:41:11,808 INFO L435 NwaCegarLoop]: 152 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, 152 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:41:11,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:41:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 05:41:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-17 05:41:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:41:11,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2025-03-17 05:41:11,862 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 135 [2025-03-17 05:41:11,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:11,863 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2025-03-17 05:41:11,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:41:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2025-03-17 05:41:11,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:41:11,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:11,865 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:11,872 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 (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:41:12,066 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:41:12,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:12,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:12,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1570482353, now seen corresponding path program 1 times [2025-03-17 05:41:12,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:12,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895907161] [2025-03-17 05:41:12,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:12,068 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:41:12,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:12,071 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:41:12,072 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:41:12,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:41:12,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:41:12,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:12,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:12,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:41:12,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:12,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:41:12,406 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:12,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895907161] [2025-03-17 05:41:12,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895907161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:12,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:12,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:41:12,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246148665] [2025-03-17 05:41:12,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:12,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:41:12,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:12,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:41:12,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:41:12,410 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:12,486 INFO L93 Difference]: Finished difference Result 212 states and 313 transitions. [2025-03-17 05:41:12,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:41:12,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-17 05:41:12,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:12,489 INFO L225 Difference]: With dead ends: 212 [2025-03-17 05:41:12,490 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 05:41:12,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:41:12,492 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:12,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 704 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:41:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 05:41:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-17 05:41:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:41:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2025-03-17 05:41:12,505 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 135 [2025-03-17 05:41:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:12,508 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2025-03-17 05:41:12,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2025-03-17 05:41:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:41:12,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:12,511 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:12,517 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:41:12,711 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:41:12,712 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:12,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:12,712 INFO L85 PathProgramCache]: Analyzing trace with hash -236972110, now seen corresponding path program 1 times [2025-03-17 05:41:12,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:12,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95172304] [2025-03-17 05:41:12,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:12,713 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:41:12,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:12,715 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:41:12,717 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:41:12,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:41:12,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:41:12,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:12,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:12,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:41:12,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:13,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:41:13,004 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:13,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95172304] [2025-03-17 05:41:13,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95172304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:13,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:13,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:41:13,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546565869] [2025-03-17 05:41:13,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:13,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:41:13,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:13,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:41:13,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:41:13,008 INFO L87 Difference]: Start difference. First operand 109 states and 158 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:13,076 INFO L93 Difference]: Finished difference Result 220 states and 319 transitions. [2025-03-17 05:41:13,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:41:13,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-17 05:41:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:13,078 INFO L225 Difference]: With dead ends: 220 [2025-03-17 05:41:13,078 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 05:41:13,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:41:13,082 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:13,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 833 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:41:13,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 05:41:13,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-03-17 05:41:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:41:13,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2025-03-17 05:41:13,094 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 135 [2025-03-17 05:41:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:13,096 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2025-03-17 05:41:13,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2025-03-17 05:41:13,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:41:13,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:13,100 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:13,107 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 (4)] Ended with exit code 0 [2025-03-17 05:41:13,301 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:41:13,301 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:13,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:13,302 INFO L85 PathProgramCache]: Analyzing trace with hash 650531571, now seen corresponding path program 1 times [2025-03-17 05:41:13,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:13,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485024663] [2025-03-17 05:41:13,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:13,302 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:41:13,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:13,306 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:41:13,307 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:41:13,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:41:13,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:41:13,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:13,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:13,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 05:41:13,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:13,579 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:41:13,579 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:13,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485024663] [2025-03-17 05:41:13,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485024663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:13,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:13,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:41:13,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980003422] [2025-03-17 05:41:13,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:13,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:41:13,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:13,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:41:13,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:41:13,580 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:13,641 INFO L93 Difference]: Finished difference Result 224 states and 323 transitions. [2025-03-17 05:41:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:41:13,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-17 05:41:13,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:13,642 INFO L225 Difference]: With dead ends: 224 [2025-03-17 05:41:13,642 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 05:41:13,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 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:41:13,643 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:13,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 964 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:41:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 05:41:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-17 05:41:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:41:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2025-03-17 05:41:13,654 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 135 [2025-03-17 05:41:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:13,654 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2025-03-17 05:41:13,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2025-03-17 05:41:13,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:41:13,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:13,655 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:13,663 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 (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:41:13,862 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:41:13,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:13,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash 651455092, now seen corresponding path program 1 times [2025-03-17 05:41:13,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:13,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636671479] [2025-03-17 05:41:13,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:13,863 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:41:13,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:13,865 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:41:13,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 (6)] Waiting until timeout for monitored process [2025-03-17 05:41:13,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:41:14,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:41:14,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:14,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:14,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:41:14,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:15,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 05:41:15,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2025-03-17 05:41:16,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 05:41:16,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:16,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 05:41:16,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 05:41:17,185 INFO L349 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2025-03-17 05:41:17,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 58 [2025-03-17 05:41:17,268 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 15 treesize of output 7 [2025-03-17 05:41:17,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:41:17,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 22 [2025-03-17 05:41:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 97 proven. 350 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-17 05:41:17,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:17,448 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:17,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636671479] [2025-03-17 05:41:17,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636671479] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:17,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1276972594] [2025-03-17 05:41:17,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:17,449 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:41:17,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:41:17,450 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:41:17,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-17 05:41:17,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:41:17,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:41:17,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:17,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:17,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 05:41:17,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:19,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 05:41:19,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-03-17 05:41:20,123 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:41:20,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 05:41:21,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 05:41:21,347 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2025-03-17 05:41:21,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 43 [2025-03-17 05:41:21,438 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 15 treesize of output 7 [2025-03-17 05:41:21,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2025-03-17 05:41:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 97 proven. 350 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-17 05:41:21,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:21,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1276972594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:21,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:41:21,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2025-03-17 05:41:21,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353493270] [2025-03-17 05:41:21,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:41:21,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 05:41:21,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:21,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 05:41:21,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:41:21,531 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 21 states, 19 states have (on average 5.947368421052632) internal successors, (113), 20 states have internal predecessors, (113), 12 states have call successors, (34), 10 states have call predecessors, (34), 12 states have return successors, (34), 10 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-17 05:41:24,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:24,840 INFO L93 Difference]: Finished difference Result 377 states and 536 transitions. [2025-03-17 05:41:24,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:41:24,842 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.947368421052632) internal successors, (113), 20 states have internal predecessors, (113), 12 states have call successors, (34), 10 states have call predecessors, (34), 12 states have return successors, (34), 10 states have call predecessors, (34), 12 states have call successors, (34) Word has length 135 [2025-03-17 05:41:24,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:24,843 INFO L225 Difference]: With dead ends: 377 [2025-03-17 05:41:24,843 INFO L226 Difference]: Without dead ends: 265 [2025-03-17 05:41:24,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=332, Invalid=1150, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 05:41:24,844 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 746 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:24,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1925 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 05:41:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-17 05:41:24,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 256. [2025-03-17 05:41:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 207 states have internal predecessors, (275), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 05:41:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 365 transitions. [2025-03-17 05:41:24,879 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 365 transitions. Word has length 135 [2025-03-17 05:41:24,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:24,879 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 365 transitions. [2025-03-17 05:41:24,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.947368421052632) internal successors, (113), 20 states have internal predecessors, (113), 12 states have call successors, (34), 10 states have call predecessors, (34), 12 states have return successors, (34), 10 states have call predecessors, (34), 12 states have call successors, (34) [2025-03-17 05:41:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 365 transitions. [2025-03-17 05:41:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:41:24,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:24,881 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:24,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-17 05:41:25,088 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:41:25,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:41:25,285 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:25,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:25,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1148066414, now seen corresponding path program 1 times [2025-03-17 05:41:25,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:25,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059431517] [2025-03-17 05:41:25,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:25,286 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:41:25,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:25,288 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:41:25,290 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:41:25,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:41:25,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:41:25,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:25,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:25,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:41:25,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 13 proven. 207 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-17 05:41:25,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:25,764 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:25,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059431517] [2025-03-17 05:41:25,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059431517] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:25,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:41:25,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-17 05:41:25,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681564125] [2025-03-17 05:41:25,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:25,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:41:25,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:25,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:41:25,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:41:25,765 INFO L87 Difference]: Start difference. First operand 256 states and 365 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:25,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:25,836 INFO L93 Difference]: Finished difference Result 494 states and 704 transitions. [2025-03-17 05:41:25,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:41:25,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2025-03-17 05:41:25,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:25,839 INFO L225 Difference]: With dead ends: 494 [2025-03-17 05:41:25,839 INFO L226 Difference]: Without dead ends: 382 [2025-03-17 05:41:25,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:41:25,840 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 152 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:25,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 420 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:41:25,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-17 05:41:25,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 262. [2025-03-17 05:41:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 212 states have (on average 1.3349056603773586) internal successors, (283), 213 states have internal predecessors, (283), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 05:41:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 373 transitions. [2025-03-17 05:41:25,861 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 373 transitions. Word has length 137 [2025-03-17 05:41:25,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:25,861 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 373 transitions. [2025-03-17 05:41:25,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 373 transitions. [2025-03-17 05:41:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:41:25,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:25,863 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:25,869 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:41:26,063 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:41:26,064 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:26,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:26,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1272105106, now seen corresponding path program 1 times [2025-03-17 05:41:26,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:26,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132195162] [2025-03-17 05:41:26,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:26,064 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:41:26,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:26,066 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:41:26,067 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:41:26,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:41:26,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:41:26,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:26,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:26,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:41:26,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:26,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-17 05:41:27,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-17 05:41:27,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-17 05:41:27,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:41:27,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 42 [2025-03-17 05:41:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:41:27,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:28,100 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:28,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132195162] [2025-03-17 05:41:28,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132195162] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:28,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:41:28,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-17 05:41:28,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138690548] [2025-03-17 05:41:28,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:28,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:41:28,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:28,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:41:28,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:41:28,101 INFO L87 Difference]: Start difference. First operand 262 states and 373 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:28,420 INFO L93 Difference]: Finished difference Result 584 states and 824 transitions. [2025-03-17 05:41:28,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:41:28,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2025-03-17 05:41:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:28,422 INFO L225 Difference]: With dead ends: 584 [2025-03-17 05:41:28,422 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 05:41:28,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:41:28,425 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 294 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:28,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 692 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:41:28,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 05:41:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2025-03-17 05:41:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 293 states have (on average 1.3378839590443685) internal successors, (392), 295 states have internal predecessors, (392), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 05:41:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 492 transitions. [2025-03-17 05:41:28,460 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 492 transitions. Word has length 137 [2025-03-17 05:41:28,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:28,460 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 492 transitions. [2025-03-17 05:41:28,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:28,460 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 492 transitions. [2025-03-17 05:41:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:41:28,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:28,462 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:28,469 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:41:28,662 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:41:28,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:28,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1136750287, now seen corresponding path program 1 times [2025-03-17 05:41:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:28,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307058784] [2025-03-17 05:41:28,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:28,663 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:41:28,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:28,665 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:41:28,666 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:41:28,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:41:28,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:41:28,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:28,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:28,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:41:28,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:28,833 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:41:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:28,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:41:28,929 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:28,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307058784] [2025-03-17 05:41:28,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307058784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:28,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:28,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:41:28,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688010465] [2025-03-17 05:41:28,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:28,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:41:28,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:28,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:41:28,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:41:28,930 INFO L87 Difference]: Start difference. First operand 351 states and 492 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:29,046 INFO L93 Difference]: Finished difference Result 819 states and 1147 transitions. [2025-03-17 05:41:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:41:29,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2025-03-17 05:41:29,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:29,048 INFO L225 Difference]: With dead ends: 819 [2025-03-17 05:41:29,048 INFO L226 Difference]: Without dead ends: 504 [2025-03-17 05:41:29,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:41:29,049 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 141 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:29,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 586 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:41:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-17 05:41:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 373. [2025-03-17 05:41:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 307 states have (on average 1.3224755700325732) internal successors, (406), 308 states have internal predecessors, (406), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:41:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 518 transitions. [2025-03-17 05:41:29,075 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 518 transitions. Word has length 137 [2025-03-17 05:41:29,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:29,075 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 518 transitions. [2025-03-17 05:41:29,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 518 transitions. [2025-03-17 05:41:29,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:41:29,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:29,076 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:29,082 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:41:29,276 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:41:29,277 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:29,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:29,277 INFO L85 PathProgramCache]: Analyzing trace with hash 678582735, now seen corresponding path program 1 times [2025-03-17 05:41:29,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:29,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882167763] [2025-03-17 05:41:29,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:29,277 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:41:29,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:29,279 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:41:29,280 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:41:29,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:41:29,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:41:29,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:29,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:29,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:41:29,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 13 proven. 207 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-17 05:41:29,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:29,812 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:29,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882167763] [2025-03-17 05:41:29,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882167763] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:29,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:41:29,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-03-17 05:41:29,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441118278] [2025-03-17 05:41:29,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:29,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:41:29,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:29,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:41:29,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:41:29,814 INFO L87 Difference]: Start difference. First operand 373 states and 518 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:29,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:29,894 INFO L93 Difference]: Finished difference Result 880 states and 1233 transitions. [2025-03-17 05:41:29,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:41:29,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-17 05:41:29,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:29,897 INFO L225 Difference]: With dead ends: 880 [2025-03-17 05:41:29,897 INFO L226 Difference]: Without dead ends: 565 [2025-03-17 05:41:29,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:41:29,898 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 73 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:29,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 661 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:41:29,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-17 05:41:29,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 421. [2025-03-17 05:41:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 355 states have (on average 1.343661971830986) internal successors, (477), 356 states have internal predecessors, (477), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:41:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 589 transitions. [2025-03-17 05:41:29,925 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 589 transitions. Word has length 139 [2025-03-17 05:41:29,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:29,926 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 589 transitions. [2025-03-17 05:41:29,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 589 transitions. [2025-03-17 05:41:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:41:29,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:29,927 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:29,933 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 (11)] Forceful destruction successful, exit code 0 [2025-03-17 05:41:30,127 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:41:30,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:30,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:30,128 INFO L85 PathProgramCache]: Analyzing trace with hash -318489618, now seen corresponding path program 1 times [2025-03-17 05:41:30,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:30,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222784728] [2025-03-17 05:41:30,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:30,129 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:41:30,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:30,130 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:41:30,131 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:41:30,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:41:30,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:41:30,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:30,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:30,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:41:30,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:30,311 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:41:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:30,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:41:30,418 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:30,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222784728] [2025-03-17 05:41:30,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1222784728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:30,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:30,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:41:30,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466170989] [2025-03-17 05:41:30,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:30,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:41:30,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:30,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:41:30,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:41:30,419 INFO L87 Difference]: Start difference. First operand 421 states and 589 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:30,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:30,536 INFO L93 Difference]: Finished difference Result 929 states and 1307 transitions. [2025-03-17 05:41:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:41:30,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-17 05:41:30,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:30,539 INFO L225 Difference]: With dead ends: 929 [2025-03-17 05:41:30,539 INFO L226 Difference]: Without dead ends: 566 [2025-03-17 05:41:30,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 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:41:30,540 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 126 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:30,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 583 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:41:30,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-17 05:41:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 469. [2025-03-17 05:41:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 403 states have (on average 1.3548387096774193) internal successors, (546), 404 states have internal predecessors, (546), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:41:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 658 transitions. [2025-03-17 05:41:30,574 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 658 transitions. Word has length 139 [2025-03-17 05:41:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:30,575 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 658 transitions. [2025-03-17 05:41:30,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 658 transitions. [2025-03-17 05:41:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:41:30,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:30,576 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:30,584 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:41:30,777 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:41:30,777 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:30,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:30,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1430865172, now seen corresponding path program 1 times [2025-03-17 05:41:30,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:30,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019699044] [2025-03-17 05:41:30,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:30,778 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:41:30,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:30,780 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:41:30,781 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:41:30,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:41:30,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:41:30,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:30,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:30,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:41:30,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:30,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:41:30,965 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:30,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019699044] [2025-03-17 05:41:30,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019699044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:30,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:30,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:41:30,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727557016] [2025-03-17 05:41:30,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:30,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:41:30,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:30,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:41:30,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:41:30,966 INFO L87 Difference]: Start difference. First operand 469 states and 658 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:31,004 INFO L93 Difference]: Finished difference Result 841 states and 1185 transitions. [2025-03-17 05:41:31,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:41:31,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-17 05:41:31,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:31,007 INFO L225 Difference]: With dead ends: 841 [2025-03-17 05:41:31,007 INFO L226 Difference]: Without dead ends: 478 [2025-03-17 05:41:31,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:41:31,008 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:31,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 579 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:41:31,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-17 05:41:31,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2025-03-17 05:41:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 412 states have (on average 1.3470873786407767) internal successors, (555), 413 states have internal predecessors, (555), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:41:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 667 transitions. [2025-03-17 05:41:31,033 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 667 transitions. Word has length 139 [2025-03-17 05:41:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:31,034 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 667 transitions. [2025-03-17 05:41:31,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 667 transitions. [2025-03-17 05:41:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 05:41:31,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:31,035 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:31,042 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:41:31,236 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:41:31,236 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:31,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:31,237 INFO L85 PathProgramCache]: Analyzing trace with hash -919581388, now seen corresponding path program 1 times [2025-03-17 05:41:31,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:31,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604531862] [2025-03-17 05:41:31,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:31,237 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:41:31,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:31,239 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:41:31,239 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:41:31,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 05:41:31,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 05:41:31,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:31,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:31,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:41:31,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 13 proven. 207 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-17 05:41:31,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:31,699 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:31,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604531862] [2025-03-17 05:41:31,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604531862] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:31,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:41:31,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-17 05:41:31,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651375260] [2025-03-17 05:41:31,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:31,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:41:31,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:31,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:41:31,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:41:31,700 INFO L87 Difference]: Start difference. First operand 478 states and 667 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:31,782 INFO L93 Difference]: Finished difference Result 969 states and 1355 transitions. [2025-03-17 05:41:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:41:31,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-03-17 05:41:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:31,785 INFO L225 Difference]: With dead ends: 969 [2025-03-17 05:41:31,785 INFO L226 Difference]: Without dead ends: 597 [2025-03-17 05:41:31,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:41:31,786 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 59 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:31,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 561 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:41:31,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-17 05:41:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 507. [2025-03-17 05:41:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 441 states have (on average 1.3537414965986394) internal successors, (597), 442 states have internal predecessors, (597), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:41:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 709 transitions. [2025-03-17 05:41:31,810 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 709 transitions. Word has length 140 [2025-03-17 05:41:31,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:31,810 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 709 transitions. [2025-03-17 05:41:31,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 709 transitions. [2025-03-17 05:41:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:41:31,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:31,811 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:31,820 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 (14)] Ended with exit code 0 [2025-03-17 05:41:32,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:41:32,013 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:32,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:32,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2020884690, now seen corresponding path program 1 times [2025-03-17 05:41:32,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:32,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398188772] [2025-03-17 05:41:32,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:32,014 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:41:32,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:32,016 INFO L229 MonitoredProcess]: Starting monitored process 15 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:41:32,018 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 (15)] Waiting until timeout for monitored process [2025-03-17 05:41:32,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:41:32,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:41:32,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:32,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:32,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:41:32,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 13 proven. 207 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-17 05:41:32,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:32,504 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:32,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398188772] [2025-03-17 05:41:32,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398188772] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:32,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:41:32,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-17 05:41:32,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640931608] [2025-03-17 05:41:32,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:32,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:41:32,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:32,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:41:32,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:41:32,505 INFO L87 Difference]: Start difference. First operand 507 states and 709 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:32,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:32,581 INFO L93 Difference]: Finished difference Result 984 states and 1374 transitions. [2025-03-17 05:41:32,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:41:32,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-17 05:41:32,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:32,584 INFO L225 Difference]: With dead ends: 984 [2025-03-17 05:41:32,584 INFO L226 Difference]: Without dead ends: 583 [2025-03-17 05:41:32,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:41:32,586 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 102 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:32,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 449 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:41:32,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-17 05:41:32,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 515. [2025-03-17 05:41:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 449 states have (on average 1.3474387527839644) internal successors, (605), 450 states have internal predecessors, (605), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:41:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 717 transitions. [2025-03-17 05:41:32,611 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 717 transitions. Word has length 141 [2025-03-17 05:41:32,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:32,611 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 717 transitions. [2025-03-17 05:41:32,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:32,612 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 717 transitions. [2025-03-17 05:41:32,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 05:41:32,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:32,613 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:32,619 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 (15)] Forceful destruction successful, exit code 0 [2025-03-17 05:41:32,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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:41:32,814 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:32,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:32,814 INFO L85 PathProgramCache]: Analyzing trace with hash -164178217, now seen corresponding path program 1 times [2025-03-17 05:41:32,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:32,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916456935] [2025-03-17 05:41:32,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:32,815 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:41:32,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:32,817 INFO L229 MonitoredProcess]: Starting monitored process 16 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:41:32,817 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 (16)] Waiting until timeout for monitored process [2025-03-17 05:41:32,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:41:33,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:41:33,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:33,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:33,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 05:41:33,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:33,904 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:41:34,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 05:41:34,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:41:34,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 05:41:34,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 05:41:34,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2025-03-17 05:41:34,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2025-03-17 05:41:35,011 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 15 treesize of output 7 [2025-03-17 05:41:35,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:41:35,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 42 [2025-03-17 05:41:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 57 proven. 350 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-17 05:41:35,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:35,595 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:35,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916456935] [2025-03-17 05:41:35,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916456935] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:35,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:41:35,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 24 [2025-03-17 05:41:35,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204493361] [2025-03-17 05:41:35,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:35,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:41:35,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:35,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:41:35,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:41:35,597 INFO L87 Difference]: Start difference. First operand 515 states and 717 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:36,913 INFO L93 Difference]: Finished difference Result 1053 states and 1476 transitions. [2025-03-17 05:41:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:41:36,914 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 142 [2025-03-17 05:41:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:36,917 INFO L225 Difference]: With dead ends: 1053 [2025-03-17 05:41:36,917 INFO L226 Difference]: Without dead ends: 644 [2025-03-17 05:41:36,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2025-03-17 05:41:36,918 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 156 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:36,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1138 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:41:36,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-03-17 05:41:36,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 525. [2025-03-17 05:41:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 459 states have (on average 1.3507625272331154) internal successors, (620), 460 states have internal predecessors, (620), 56 states have call successors, (56), 9 states have call predecessors, (56), 9 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:41:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 732 transitions. [2025-03-17 05:41:36,946 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 732 transitions. Word has length 142 [2025-03-17 05:41:36,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:36,947 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 732 transitions. [2025-03-17 05:41:36,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 732 transitions. [2025-03-17 05:41:36,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 05:41:36,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:36,948 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:36,955 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 (16)] Ended with exit code 0 [2025-03-17 05:41:37,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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:41:37,149 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:37,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:37,149 INFO L85 PathProgramCache]: Analyzing trace with hash 528923480, now seen corresponding path program 1 times [2025-03-17 05:41:37,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:37,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927700492] [2025-03-17 05:41:37,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:37,150 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:41:37,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:37,152 INFO L229 MonitoredProcess]: Starting monitored process 17 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:41:37,153 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 (17)] Waiting until timeout for monitored process [2025-03-17 05:41:37,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:41:37,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:41:37,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:37,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:37,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 05:41:37,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:37,956 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:41:38,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-03-17 05:41:38,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2025-03-17 05:41:38,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:41:38,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 40 [2025-03-17 05:41:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:41:38,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:39,269 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:39,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927700492] [2025-03-17 05:41:39,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927700492] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:39,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1025251470] [2025-03-17 05:41:39,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:39,269 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:41:39,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:41:39,271 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:41:39,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2025-03-17 05:41:39,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:41:39,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:41:39,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:39,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:39,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 05:41:39,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:40,460 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:41:41,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-03-17 05:41:41,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2025-03-17 05:41:41,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2025-03-17 05:41:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:41:41,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:41:41,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1025251470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:41:41,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:41:41,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-03-17 05:41:41,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453063571] [2025-03-17 05:41:41,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:41:41,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:41:41,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:41,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:41:41,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:41:41,519 INFO L87 Difference]: Start difference. First operand 525 states and 732 transitions. Second operand has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 12 states have internal predecessors, (109), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 05:41:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:42,483 INFO L93 Difference]: Finished difference Result 880 states and 1225 transitions. [2025-03-17 05:41:42,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:41:42,484 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 12 states have internal predecessors, (109), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 142 [2025-03-17 05:41:42,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:42,486 INFO L225 Difference]: With dead ends: 880 [2025-03-17 05:41:42,486 INFO L226 Difference]: Without dead ends: 627 [2025-03-17 05:41:42,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:41:42,487 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 719 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:42,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 954 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:41:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-03-17 05:41:42,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 624. [2025-03-17 05:41:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 547 states have (on average 1.3473491773308959) internal successors, (737), 549 states have internal predecessors, (737), 63 states have call successors, (63), 13 states have call predecessors, (63), 13 states have return successors, (63), 61 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-17 05:41:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 863 transitions. [2025-03-17 05:41:42,520 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 863 transitions. Word has length 142 [2025-03-17 05:41:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:42,520 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 863 transitions. [2025-03-17 05:41:42,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 12 states have internal predecessors, (109), 4 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2025-03-17 05:41:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 863 transitions. [2025-03-17 05:41:42,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 05:41:42,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:42,521 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:42,528 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 (17)] Ended with exit code 0 [2025-03-17 05:41:42,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2025-03-17 05:41:42,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:41:42,922 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:42,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:42,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1150071510, now seen corresponding path program 1 times [2025-03-17 05:41:42,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:42,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841289178] [2025-03-17 05:41:42,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:42,923 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:41:42,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:42,925 INFO L229 MonitoredProcess]: Starting monitored process 19 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:41:42,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 (19)] Waiting until timeout for monitored process [2025-03-17 05:41:43,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:41:43,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:41:43,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:43,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:43,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:41:43,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:43,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2025-03-17 05:41:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:44,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:41:44,194 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:44,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841289178] [2025-03-17 05:41:44,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841289178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:44,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:44,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:41:44,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853134684] [2025-03-17 05:41:44,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:44,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:41:44,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:44,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:41:44,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:41:44,196 INFO L87 Difference]: Start difference. First operand 624 states and 863 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:44,521 INFO L93 Difference]: Finished difference Result 1494 states and 2049 transitions. [2025-03-17 05:41:44,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:41:44,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 142 [2025-03-17 05:41:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:44,526 INFO L225 Difference]: With dead ends: 1494 [2025-03-17 05:41:44,527 INFO L226 Difference]: Without dead ends: 988 [2025-03-17 05:41:44,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:41:44,529 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 207 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:44,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 858 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:41:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2025-03-17 05:41:44,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 984. [2025-03-17 05:41:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 865 states have (on average 1.323699421965318) internal successors, (1145), 871 states have internal predecessors, (1145), 97 states have call successors, (97), 21 states have call predecessors, (97), 21 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-17 05:41:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1339 transitions. [2025-03-17 05:41:44,595 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1339 transitions. Word has length 142 [2025-03-17 05:41:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:44,595 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1339 transitions. [2025-03-17 05:41:44,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1339 transitions. [2025-03-17 05:41:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:41:44,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:44,597 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:44,603 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 (19)] Ended with exit code 0 [2025-03-17 05:41:44,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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:41:44,797 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:44,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:44,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1824914712, now seen corresponding path program 1 times [2025-03-17 05:41:44,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:44,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510081740] [2025-03-17 05:41:44,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:44,798 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:41:44,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:44,800 INFO L229 MonitoredProcess]: Starting monitored process 20 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:41:44,804 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 (20)] Waiting until timeout for monitored process [2025-03-17 05:41:44,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:41:44,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:41:44,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:44,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:44,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 05:41:44,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:45,000 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:41:45,000 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:45,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510081740] [2025-03-17 05:41:45,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510081740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:45,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:45,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:41:45,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956213454] [2025-03-17 05:41:45,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:45,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:41:45,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:45,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:41:45,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:41:45,001 INFO L87 Difference]: Start difference. First operand 984 states and 1339 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:45,064 INFO L93 Difference]: Finished difference Result 1872 states and 2558 transitions. [2025-03-17 05:41:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:41:45,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2025-03-17 05:41:45,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:45,068 INFO L225 Difference]: With dead ends: 1872 [2025-03-17 05:41:45,068 INFO L226 Difference]: Without dead ends: 998 [2025-03-17 05:41:45,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:41:45,070 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:45,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:41:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-03-17 05:41:45,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 998. [2025-03-17 05:41:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 879 states have (on average 1.3185437997724687) internal successors, (1159), 885 states have internal predecessors, (1159), 97 states have call successors, (97), 21 states have call predecessors, (97), 21 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-17 05:41:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1353 transitions. [2025-03-17 05:41:45,136 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1353 transitions. Word has length 144 [2025-03-17 05:41:45,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:45,136 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1353 transitions. [2025-03-17 05:41:45,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1353 transitions. [2025-03-17 05:41:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:41:45,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:45,139 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:45,146 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 (20)] Forceful destruction successful, exit code 0 [2025-03-17 05:41:45,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:41:45,340 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:45,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash 359367916, now seen corresponding path program 1 times [2025-03-17 05:41:45,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:45,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129824453] [2025-03-17 05:41:45,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:45,341 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:41:45,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:45,343 INFO L229 MonitoredProcess]: Starting monitored process 21 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:41:45,345 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 (21)] Waiting until timeout for monitored process [2025-03-17 05:41:45,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:41:45,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:41:45,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:45,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:45,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 05:41:45,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:41:45,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:41:45,565 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:41:45,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129824453] [2025-03-17 05:41:45,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129824453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:41:45,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:41:45,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:41:45,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98645445] [2025-03-17 05:41:45,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:41:45,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:41:45,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:41:45,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:41:45,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:41:45,566 INFO L87 Difference]: Start difference. First operand 998 states and 1353 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:41:45,626 INFO L93 Difference]: Finished difference Result 1874 states and 2550 transitions. [2025-03-17 05:41:45,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:41:45,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2025-03-17 05:41:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:41:45,630 INFO L225 Difference]: With dead ends: 1874 [2025-03-17 05:41:45,630 INFO L226 Difference]: Without dead ends: 1006 [2025-03-17 05:41:45,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:41:45,632 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:41:45,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:41:45,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-03-17 05:41:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1006. [2025-03-17 05:41:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 887 states have (on average 1.3156708004509583) internal successors, (1167), 893 states have internal predecessors, (1167), 97 states have call successors, (97), 21 states have call predecessors, (97), 21 states have return successors, (97), 91 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-17 05:41:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1361 transitions. [2025-03-17 05:41:45,702 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1361 transitions. Word has length 144 [2025-03-17 05:41:45,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:41:45,703 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1361 transitions. [2025-03-17 05:41:45,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:41:45,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1361 transitions. [2025-03-17 05:41:45,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:41:45,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:41:45,704 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:45,711 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 (21)] Ended with exit code 0 [2025-03-17 05:41:45,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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:41:45,907 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:41:45,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:41:45,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1049406879, now seen corresponding path program 1 times [2025-03-17 05:41:45,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:41:45,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049335340] [2025-03-17 05:41:45,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:41:45,908 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:41:45,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:41:45,910 INFO L229 MonitoredProcess]: Starting monitored process 22 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:41:45,910 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 (22)] Waiting until timeout for monitored process [2025-03-17 05:41:46,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:41:46,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:41:46,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:41:46,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:41:46,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 05:41:46,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:41:47,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-17 05:41:47,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-17 05:41:47,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 05:41:48,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11