./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-55.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-55.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 0de8f92e263c447336155b650efb70abf388c63a83fbed90771c90584f080fb9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:36:32,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:36:32,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:36:32,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:36:32,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:36:32,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:36:32,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:36:32,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:36:32,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:36:32,543 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:36:32,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:36:32,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:36:32,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:36:32,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:36:32,544 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:36:32,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:36:32,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:36:32,544 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:36:32,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:36:32,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:36:32,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:36:32,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:36:32,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:36:32,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:36:32,545 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:36:32,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:36:32,545 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:36:32,545 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:36:32,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:36:32,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:36:32,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:36:32,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:36:32,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:36:32,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:36:32,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:36:32,546 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:36:32,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:36:32,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:36:32,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:36:32,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:36:32,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:36:32,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:36:32,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:36:32,547 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 -> 0de8f92e263c447336155b650efb70abf388c63a83fbed90771c90584f080fb9 [2025-03-17 05:36:32,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:36:32,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:36:32,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:36:32,778 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:36:32,778 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:36:32,780 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-55.i [2025-03-17 05:36:33,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bd3b36d9/fff55da609514eb59124ec931a746c35/FLAGf486bda5e [2025-03-17 05:36:34,222 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:36:34,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-55.i [2025-03-17 05:36:34,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bd3b36d9/fff55da609514eb59124ec931a746c35/FLAGf486bda5e [2025-03-17 05:36:34,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bd3b36d9/fff55da609514eb59124ec931a746c35 [2025-03-17 05:36:34,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:36:34,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:36:34,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:36:34,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:36:34,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:36:34,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:36:34" (1/1) ... [2025-03-17 05:36:34,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa72034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:34, skipping insertion in model container [2025-03-17 05:36:34,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:36:34" (1/1) ... [2025-03-17 05:36:34,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:36:34,678 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-55.i[917,930] [2025-03-17 05:36:34,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:36:34,755 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:36:34,762 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-55.i[917,930] [2025-03-17 05:36:34,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:36:34,799 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:36:34,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:34 WrapperNode [2025-03-17 05:36:34,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:36:34,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:36:34,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:36:34,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:36:34,804 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:36:34" (1/1) ... [2025-03-17 05:36:34,817 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:36:34" (1/1) ... [2025-03-17 05:36:34,855 INFO L138 Inliner]: procedures = 29, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2025-03-17 05:36:34,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:36:34,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:36:34,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:36:34,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:36:34,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:34" (1/1) ... [2025-03-17 05:36:34,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:34" (1/1) ... [2025-03-17 05:36:34,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:34" (1/1) ... [2025-03-17 05:36:34,890 INFO L175 MemorySlicer]: Split 108 memory accesses to 8 slices as follows [2, 14, 37, 3, 6, 24, 3, 19]. 34 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 2, 5, 1, 1, 3, 1, 1]. The 17 writes are split as follows [0, 2, 5, 1, 2, 3, 1, 3]. [2025-03-17 05:36:34,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:34" (1/1) ... [2025-03-17 05:36:34,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:34" (1/1) ... [2025-03-17 05:36:34,906 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:34" (1/1) ... [2025-03-17 05:36:34,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:34" (1/1) ... [2025-03-17 05:36:34,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:34" (1/1) ... [2025-03-17 05:36:34,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:34" (1/1) ... [2025-03-17 05:36:34,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:36:34,919 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:36:34,920 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:36:34,920 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:36:34,920 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:34" (1/1) ... [2025-03-17 05:36:34,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:36:34,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:34,948 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:36:34,950 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:36:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:36:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:36:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:36:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:36:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:36:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:36:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:36:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:36:34,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-17 05:36:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:36:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:36:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:36:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:36:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:36:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:36:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:36:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:36:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:36:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:36:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:36:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:36:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:36:34,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:36:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:36:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-17 05:36:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:36:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:36:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:36:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:36:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:36:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:36:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:36:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:36:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:36:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:36:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:36:34,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:36:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:36:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:36:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:36:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-17 05:36:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:36:34,970 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:36:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:36:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:36:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:36:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:36:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:36:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:36:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:36:34,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:36:34,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:36:34,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:36:35,109 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:36:35,111 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:36:35,427 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem74#1;havoc property_#t~ite82#1;havoc property_#t~mem75#1;havoc property_#t~short76#1;havoc property_#t~ite80#1;havoc property_#t~ite79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem81#1;havoc property_#t~mem83#1;havoc property_#t~ite89#1;havoc property_#t~mem88#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~bitwise93#1;havoc property_#t~mem94#1;havoc property_#t~ite98#1;havoc property_#t~mem95#1;havoc property_#t~bitwise96#1;havoc property_#t~mem97#1;havoc property_#t~ite107#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short108#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~short111#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~short114#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~short117#1; [2025-03-17 05:36:35,458 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2025-03-17 05:36:35,458 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:36:35,474 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:36:35,474 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:36:35,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:36:35 BoogieIcfgContainer [2025-03-17 05:36:35,474 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:36:35,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:36:35,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:36:35,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:36:35,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:36:34" (1/3) ... [2025-03-17 05:36:35,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48fc7314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:36:35, skipping insertion in model container [2025-03-17 05:36:35,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:34" (2/3) ... [2025-03-17 05:36:35,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48fc7314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:36:35, skipping insertion in model container [2025-03-17 05:36:35,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:36:35" (3/3) ... [2025-03-17 05:36:35,481 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-55.i [2025-03-17 05:36:35,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:36:35,495 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-55.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:36:35,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:36:35,549 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;@6a0b9e7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:36:35,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:36:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 91 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:36:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:36:35,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:35,562 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:35,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:35,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:35,566 INFO L85 PathProgramCache]: Analyzing trace with hash 996246109, now seen corresponding path program 1 times [2025-03-17 05:36:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:35,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872131255] [2025-03-17 05:36:35,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:35,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:35,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:36:35,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:36:35,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:35,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 05:36:35,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:35,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872131255] [2025-03-17 05:36:35,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872131255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:35,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797131545] [2025-03-17 05:36:35,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:35,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:35,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:35,837 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:36:35,840 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:36:35,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:36:36,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:36:36,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:36,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:36,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:36:36,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 05:36:36,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:36:36,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797131545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:36,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:36:36,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:36:36,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248007645] [2025-03-17 05:36:36,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:36,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:36:36,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:36,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:36:36,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:36:36,090 INFO L87 Difference]: Start difference. First operand has 105 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 91 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:36:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:36,120 INFO L93 Difference]: Finished difference Result 207 states and 320 transitions. [2025-03-17 05:36:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:36:36,122 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2025-03-17 05:36:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:36,126 INFO L225 Difference]: With dead ends: 207 [2025-03-17 05:36:36,126 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 05:36:36,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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:36:36,130 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:36,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:36,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 05:36:36,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-17 05:36:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 89 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:36:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2025-03-17 05:36:36,165 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 111 [2025-03-17 05:36:36,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:36,166 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2025-03-17 05:36:36,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:36:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2025-03-17 05:36:36,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:36:36,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:36,168 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:36,175 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:36:36,368 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:36:36,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:36,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:36,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1522592165, now seen corresponding path program 1 times [2025-03-17 05:36:36,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:36,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973056343] [2025-03-17 05:36:36,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:36,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:36,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:36:36,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:36:36,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:36,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:36,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:36,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973056343] [2025-03-17 05:36:36,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973056343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:36,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:36,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:36:36,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162308584] [2025-03-17 05:36:36,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:36,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:36:36,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:36,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:36:36,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:36:36,647 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:36,688 INFO L93 Difference]: Finished difference Result 208 states and 305 transitions. [2025-03-17 05:36:36,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:36:36,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-17 05:36:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:36,691 INFO L225 Difference]: With dead ends: 208 [2025-03-17 05:36:36,692 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 05:36:36,692 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:36:36,693 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:36,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 421 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 05:36:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-17 05:36:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:36:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2025-03-17 05:36:36,705 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 111 [2025-03-17 05:36:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:36,706 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2025-03-17 05:36:36,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2025-03-17 05:36:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:36:36,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:36,708 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:36,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:36:36,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:36,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:36,709 INFO L85 PathProgramCache]: Analyzing trace with hash -284862298, now seen corresponding path program 1 times [2025-03-17 05:36:36,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:36,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101035854] [2025-03-17 05:36:36,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:36,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:36,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:36:36,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:36:36,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:36,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:36,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:36,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101035854] [2025-03-17 05:36:36,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101035854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:36,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:36,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:36:36,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115862752] [2025-03-17 05:36:36,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:36,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:36:36,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:36,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:36:36,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:36:36,924 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:36,957 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2025-03-17 05:36:36,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:36:36,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-17 05:36:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:36,961 INFO L225 Difference]: With dead ends: 212 [2025-03-17 05:36:36,961 INFO L226 Difference]: Without dead ends: 108 [2025-03-17 05:36:36,962 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:36:36,962 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:36,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 422 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:36,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-17 05:36:36,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2025-03-17 05:36:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:36:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2025-03-17 05:36:36,975 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 111 [2025-03-17 05:36:36,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:36,976 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2025-03-17 05:36:36,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:36,976 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2025-03-17 05:36:36,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:36:36,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:36,980 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:36,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:36:36,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:36,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:36,981 INFO L85 PathProgramCache]: Analyzing trace with hash 602641383, now seen corresponding path program 1 times [2025-03-17 05:36:36,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:36,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464561201] [2025-03-17 05:36:36,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:36,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:37,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:36:37,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:36:37,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:37,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:37,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:37,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464561201] [2025-03-17 05:36:37,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464561201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:37,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:37,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:36:37,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691955458] [2025-03-17 05:36:37,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:37,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:36:37,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:37,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:36:37,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:36:37,124 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:37,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:37,159 INFO L93 Difference]: Finished difference Result 216 states and 313 transitions. [2025-03-17 05:36:37,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:36:37,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-17 05:36:37,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:37,162 INFO L225 Difference]: With dead ends: 216 [2025-03-17 05:36:37,163 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 05:36:37,163 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:36:37,164 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:37,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 424 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:37,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 05:36:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-17 05:36:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:36:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-17 05:36:37,175 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 111 [2025-03-17 05:36:37,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:37,178 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-17 05:36:37,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-17 05:36:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:36:37,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:37,179 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:37,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:36:37,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:37,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:37,183 INFO L85 PathProgramCache]: Analyzing trace with hash 603564904, now seen corresponding path program 1 times [2025-03-17 05:36:37,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:37,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218654963] [2025-03-17 05:36:37,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:37,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:37,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:36:37,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:36:37,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:37,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:37,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:37,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218654963] [2025-03-17 05:36:37,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218654963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:37,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:37,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:36:37,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719533209] [2025-03-17 05:36:37,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:37,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:36:37,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:37,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:36:37,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:36:37,318 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:37,337 INFO L93 Difference]: Finished difference Result 217 states and 313 transitions. [2025-03-17 05:36:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:36:37,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-17 05:36:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:37,339 INFO L225 Difference]: With dead ends: 217 [2025-03-17 05:36:37,340 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 05:36:37,341 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:36:37,341 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:37,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 05:36:37,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-17 05:36:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 95 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:36:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-03-17 05:36:37,354 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 111 [2025-03-17 05:36:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:37,354 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-03-17 05:36:37,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-03-17 05:36:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:36:37,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:37,355 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:37,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:36:37,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:37,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:37,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1843786810, now seen corresponding path program 1 times [2025-03-17 05:36:37,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:37,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022051579] [2025-03-17 05:36:37,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:37,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:37,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:36:37,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:36:37,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:37,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:37,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:37,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022051579] [2025-03-17 05:36:37,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022051579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:37,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:37,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:36:37,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411834995] [2025-03-17 05:36:37,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:37,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:36:37,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:37,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:36:37,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:36:37,776 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:38,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:38,036 INFO L93 Difference]: Finished difference Result 382 states and 543 transitions. [2025-03-17 05:36:38,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:36:38,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-03-17 05:36:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:38,038 INFO L225 Difference]: With dead ends: 382 [2025-03-17 05:36:38,038 INFO L226 Difference]: Without dead ends: 274 [2025-03-17 05:36:38,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:36:38,040 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 224 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:38,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 571 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:36:38,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-17 05:36:38,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 166. [2025-03-17 05:36:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 139 states have (on average 1.3884892086330936) internal successors, (193), 139 states have internal predecessors, (193), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:36:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 241 transitions. [2025-03-17 05:36:38,064 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 241 transitions. Word has length 113 [2025-03-17 05:36:38,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:38,064 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 241 transitions. [2025-03-17 05:36:38,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 241 transitions. [2025-03-17 05:36:38,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:36:38,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:38,065 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:38,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:36:38,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:38,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:38,068 INFO L85 PathProgramCache]: Analyzing trace with hash 59279915, now seen corresponding path program 1 times [2025-03-17 05:36:38,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:38,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623696029] [2025-03-17 05:36:38,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:38,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:38,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:36:38,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:36:38,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:38,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:38,568 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:38,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:38,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623696029] [2025-03-17 05:36:38,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623696029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:38,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:38,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:36:38,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505707945] [2025-03-17 05:36:38,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:38,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:36:38,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:38,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:36:38,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:36:38,572 INFO L87 Difference]: Start difference. First operand 166 states and 241 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:38,863 INFO L93 Difference]: Finished difference Result 382 states and 542 transitions. [2025-03-17 05:36:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:36:38,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2025-03-17 05:36:38,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:38,867 INFO L225 Difference]: With dead ends: 382 [2025-03-17 05:36:38,867 INFO L226 Difference]: Without dead ends: 274 [2025-03-17 05:36:38,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:36:38,868 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 458 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:38,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 657 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:36:38,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-17 05:36:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 174. [2025-03-17 05:36:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 147 states have (on average 1.380952380952381) internal successors, (203), 147 states have internal predecessors, (203), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:36:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 251 transitions. [2025-03-17 05:36:38,881 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 251 transitions. Word has length 114 [2025-03-17 05:36:38,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:38,882 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 251 transitions. [2025-03-17 05:36:38,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 251 transitions. [2025-03-17 05:36:38,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:36:38,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:38,884 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:38,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:36:38,884 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:38,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:38,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1869445129, now seen corresponding path program 1 times [2025-03-17 05:36:38,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:38,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933358783] [2025-03-17 05:36:38,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:38,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:38,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:36:38,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:36:38,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:38,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:39,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:39,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933358783] [2025-03-17 05:36:39,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933358783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:39,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:39,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:36:39,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392717962] [2025-03-17 05:36:39,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:39,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:36:39,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:39,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:36:39,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:36:39,337 INFO L87 Difference]: Start difference. First operand 174 states and 251 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:39,481 INFO L93 Difference]: Finished difference Result 348 states and 494 transitions. [2025-03-17 05:36:39,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:36:39,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-03-17 05:36:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:39,484 INFO L225 Difference]: With dead ends: 348 [2025-03-17 05:36:39,484 INFO L226 Difference]: Without dead ends: 240 [2025-03-17 05:36:39,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:36:39,485 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 58 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:39,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 742 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:36:39,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-17 05:36:39,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 199. [2025-03-17 05:36:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 172 states have (on average 1.3662790697674418) internal successors, (235), 172 states have internal predecessors, (235), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:36:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 283 transitions. [2025-03-17 05:36:39,504 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 283 transitions. Word has length 115 [2025-03-17 05:36:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:39,504 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 283 transitions. [2025-03-17 05:36:39,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 283 transitions. [2025-03-17 05:36:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:36:39,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:39,506 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:39,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:36:39,506 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:39,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:39,506 INFO L85 PathProgramCache]: Analyzing trace with hash 69520958, now seen corresponding path program 1 times [2025-03-17 05:36:39,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:39,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234397121] [2025-03-17 05:36:39,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:39,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:39,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:36:39,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:36:39,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:39,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:39,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:39,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234397121] [2025-03-17 05:36:39,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234397121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:39,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:39,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:36:39,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747508722] [2025-03-17 05:36:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:39,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:36:39,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:39,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:36:39,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:36:39,794 INFO L87 Difference]: Start difference. First operand 199 states and 283 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:39,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:39,949 INFO L93 Difference]: Finished difference Result 505 states and 714 transitions. [2025-03-17 05:36:39,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:36:39,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-03-17 05:36:39,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:39,952 INFO L225 Difference]: With dead ends: 505 [2025-03-17 05:36:39,952 INFO L226 Difference]: Without dead ends: 366 [2025-03-17 05:36:39,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:36:39,953 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 268 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:39,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 818 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:36:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-17 05:36:39,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 324. [2025-03-17 05:36:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 284 states have (on average 1.3591549295774648) internal successors, (386), 284 states have internal predecessors, (386), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:36:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 458 transitions. [2025-03-17 05:36:39,966 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 458 transitions. Word has length 116 [2025-03-17 05:36:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:39,967 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 458 transitions. [2025-03-17 05:36:39,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 458 transitions. [2025-03-17 05:36:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:36:39,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:39,968 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:39,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:36:39,968 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:39,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash 762622655, now seen corresponding path program 1 times [2025-03-17 05:36:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:39,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002606649] [2025-03-17 05:36:39,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:39,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:39,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:36:40,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:36:40,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:40,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:40,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:40,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002606649] [2025-03-17 05:36:40,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002606649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:40,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:40,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:36:40,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780544798] [2025-03-17 05:36:40,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:40,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:36:40,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:40,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:36:40,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:36:40,173 INFO L87 Difference]: Start difference. First operand 324 states and 458 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:40,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:40,249 INFO L93 Difference]: Finished difference Result 668 states and 940 transitions. [2025-03-17 05:36:40,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:36:40,249 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-03-17 05:36:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:40,251 INFO L225 Difference]: With dead ends: 668 [2025-03-17 05:36:40,252 INFO L226 Difference]: Without dead ends: 407 [2025-03-17 05:36:40,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:36:40,253 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 72 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:40,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 617 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:40,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-03-17 05:36:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 324. [2025-03-17 05:36:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 284 states have (on average 1.3485915492957747) internal successors, (383), 284 states have internal predecessors, (383), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:36:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 455 transitions. [2025-03-17 05:36:40,280 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 455 transitions. Word has length 116 [2025-03-17 05:36:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:40,280 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 455 transitions. [2025-03-17 05:36:40,280 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 455 transitions. [2025-03-17 05:36:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:36:40,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:40,281 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:40,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:36:40,282 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:40,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash 731602848, now seen corresponding path program 1 times [2025-03-17 05:36:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:40,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910351740] [2025-03-17 05:36:40,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:40,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:36:40,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:36:40,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:40,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:40,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:40,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910351740] [2025-03-17 05:36:40,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910351740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:40,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:40,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:36:40,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000108166] [2025-03-17 05:36:40,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:40,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:36:40,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:40,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:36:40,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:36:40,466 INFO L87 Difference]: Start difference. First operand 324 states and 455 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:40,635 INFO L93 Difference]: Finished difference Result 821 states and 1158 transitions. [2025-03-17 05:36:40,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:36:40,636 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-03-17 05:36:40,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:40,638 INFO L225 Difference]: With dead ends: 821 [2025-03-17 05:36:40,639 INFO L226 Difference]: Without dead ends: 563 [2025-03-17 05:36:40,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:36:40,641 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 139 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:40,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 869 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:36:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-17 05:36:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 560. [2025-03-17 05:36:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 494 states have (on average 1.3461538461538463) internal successors, (665), 494 states have internal predecessors, (665), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:36:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 785 transitions. [2025-03-17 05:36:40,668 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 785 transitions. Word has length 116 [2025-03-17 05:36:40,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:40,668 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 785 transitions. [2025-03-17 05:36:40,668 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:40,668 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 785 transitions. [2025-03-17 05:36:40,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:36:40,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:40,669 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:40,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:36:40,669 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:40,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:40,670 INFO L85 PathProgramCache]: Analyzing trace with hash 644685459, now seen corresponding path program 1 times [2025-03-17 05:36:40,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:40,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546829764] [2025-03-17 05:36:40,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:40,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:40,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:36:40,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:36:40,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:40,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:40,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:40,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546829764] [2025-03-17 05:36:40,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546829764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:40,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:40,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:36:40,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463987894] [2025-03-17 05:36:40,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:40,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:36:40,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:40,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:36:40,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:36:40,831 INFO L87 Difference]: Start difference. First operand 560 states and 785 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:40,912 INFO L93 Difference]: Finished difference Result 1215 states and 1701 transitions. [2025-03-17 05:36:40,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:36:40,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2025-03-17 05:36:40,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:40,916 INFO L225 Difference]: With dead ends: 1215 [2025-03-17 05:36:40,916 INFO L226 Difference]: Without dead ends: 724 [2025-03-17 05:36:40,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:36:40,918 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 59 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:40,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 714 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:36:40,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-17 05:36:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 560. [2025-03-17 05:36:40,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 494 states have (on average 1.334008097165992) internal successors, (659), 494 states have internal predecessors, (659), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:36:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 779 transitions. [2025-03-17 05:36:40,944 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 779 transitions. Word has length 117 [2025-03-17 05:36:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:40,944 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 779 transitions. [2025-03-17 05:36:40,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 779 transitions. [2025-03-17 05:36:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:36:40,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:40,945 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:40,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:36:40,946 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:40,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:40,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1253245205, now seen corresponding path program 1 times [2025-03-17 05:36:40,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:40,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543330217] [2025-03-17 05:36:40,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:40,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:40,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:36:40,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:36:40,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:40,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:41,107 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:41,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:41,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543330217] [2025-03-17 05:36:41,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543330217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:41,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:41,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:36:41,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108824437] [2025-03-17 05:36:41,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:41,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:36:41,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:41,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:36:41,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:36:41,109 INFO L87 Difference]: Start difference. First operand 560 states and 779 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:41,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:41,177 INFO L93 Difference]: Finished difference Result 1215 states and 1689 transitions. [2025-03-17 05:36:41,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:36:41,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2025-03-17 05:36:41,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:41,180 INFO L225 Difference]: With dead ends: 1215 [2025-03-17 05:36:41,180 INFO L226 Difference]: Without dead ends: 724 [2025-03-17 05:36:41,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:36:41,182 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 53 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:41,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 536 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:41,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-17 05:36:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 598. [2025-03-17 05:36:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 532 states have (on average 1.343984962406015) internal successors, (715), 532 states have internal predecessors, (715), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:36:41,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 835 transitions. [2025-03-17 05:36:41,205 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 835 transitions. Word has length 117 [2025-03-17 05:36:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:41,206 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 835 transitions. [2025-03-17 05:36:41,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 835 transitions. [2025-03-17 05:36:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:36:41,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:41,207 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:41,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:36:41,207 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:41,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:41,208 INFO L85 PathProgramCache]: Analyzing trace with hash 747686580, now seen corresponding path program 1 times [2025-03-17 05:36:41,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:41,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314402954] [2025-03-17 05:36:41,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:41,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:41,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:36:41,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:36:41,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:41,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:41,347 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 05:36:41,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:41,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314402954] [2025-03-17 05:36:41,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314402954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:41,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671497748] [2025-03-17 05:36:41,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:41,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:41,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:41,350 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:36:41,352 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:36:41,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:36:41,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:36:41,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:41,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:41,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:36:41,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:41,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:36:41,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671497748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:41,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:36:41,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:36:41,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650041295] [2025-03-17 05:36:41,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:41,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:36:41,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:41,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:36:41,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:36:41,595 INFO L87 Difference]: Start difference. First operand 598 states and 835 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:41,648 INFO L93 Difference]: Finished difference Result 1139 states and 1592 transitions. [2025-03-17 05:36:41,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:36:41,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2025-03-17 05:36:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:41,653 INFO L225 Difference]: With dead ends: 1139 [2025-03-17 05:36:41,653 INFO L226 Difference]: Without dead ends: 610 [2025-03-17 05:36:41,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 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:36:41,655 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:41,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-03-17 05:36:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2025-03-17 05:36:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 544 states have (on average 1.3363970588235294) internal successors, (727), 544 states have internal predecessors, (727), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:36:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 847 transitions. [2025-03-17 05:36:41,688 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 847 transitions. Word has length 117 [2025-03-17 05:36:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:41,689 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 847 transitions. [2025-03-17 05:36:41,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 847 transitions. [2025-03-17 05:36:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:36:41,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:41,691 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:41,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:36:41,892 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,SelfDestructingSolverStorable13 [2025-03-17 05:36:41,893 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:41,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash 332169676, now seen corresponding path program 1 times [2025-03-17 05:36:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:41,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88075934] [2025-03-17 05:36:41,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:41,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:41,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:36:41,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:36:41,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:41,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 05:36:42,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:42,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88075934] [2025-03-17 05:36:42,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88075934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:42,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678824327] [2025-03-17 05:36:42,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:42,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:42,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:42,016 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:36:42,019 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:36:42,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:36:42,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:36:42,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:42,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:42,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:36:42,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:42,276 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:36:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:42,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:36:42,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678824327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:42,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:36:42,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-17 05:36:42,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969495373] [2025-03-17 05:36:42,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:42,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:36:42,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:42,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:36:42,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:36:42,438 INFO L87 Difference]: Start difference. First operand 610 states and 847 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:42,567 INFO L93 Difference]: Finished difference Result 1235 states and 1712 transitions. [2025-03-17 05:36:42,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:36:42,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-17 05:36:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:42,570 INFO L225 Difference]: With dead ends: 1235 [2025-03-17 05:36:42,570 INFO L226 Difference]: Without dead ends: 694 [2025-03-17 05:36:42,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:36:42,572 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 189 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:42,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 627 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:36:42,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-03-17 05:36:42,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 598. [2025-03-17 05:36:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 532 states have (on average 1.3139097744360901) internal successors, (699), 532 states have internal predecessors, (699), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:36:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 819 transitions. [2025-03-17 05:36:42,595 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 819 transitions. Word has length 118 [2025-03-17 05:36:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:42,596 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 819 transitions. [2025-03-17 05:36:42,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 819 transitions. [2025-03-17 05:36:42,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:36:42,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:42,597 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:42,604 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:36:42,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:42,802 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:42,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1685479373, now seen corresponding path program 1 times [2025-03-17 05:36:42,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:42,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947349008] [2025-03-17 05:36:42,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:42,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:42,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:36:42,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:36:42,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:42,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:42,919 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 05:36:42,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:42,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947349008] [2025-03-17 05:36:42,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947349008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:42,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410106827] [2025-03-17 05:36:42,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:42,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:42,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:42,922 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:36:42,924 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:36:43,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:36:43,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:36:43,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:43,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:43,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:36:43,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:43,168 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:43,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:36:43,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410106827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:43,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:36:43,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 05:36:43,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433845025] [2025-03-17 05:36:43,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:43,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:36:43,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:43,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:36:43,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:36:43,172 INFO L87 Difference]: Start difference. First operand 598 states and 819 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:43,217 INFO L93 Difference]: Finished difference Result 1139 states and 1560 transitions. [2025-03-17 05:36:43,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:36:43,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-17 05:36:43,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:43,233 INFO L225 Difference]: With dead ends: 1139 [2025-03-17 05:36:43,234 INFO L226 Difference]: Without dead ends: 610 [2025-03-17 05:36:43,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:36:43,235 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:43,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-03-17 05:36:43,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 602. [2025-03-17 05:36:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 536 states have (on average 1.3041044776119404) internal successors, (699), 536 states have internal predecessors, (699), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:36:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 819 transitions. [2025-03-17 05:36:43,258 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 819 transitions. Word has length 118 [2025-03-17 05:36:43,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:43,259 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 819 transitions. [2025-03-17 05:36:43,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:36:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 819 transitions. [2025-03-17 05:36:43,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:36:43,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:43,260 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:43,267 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:36:43,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 05:36:43,462 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:43,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:43,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1199086001, now seen corresponding path program 1 times [2025-03-17 05:36:43,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:43,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824288551] [2025-03-17 05:36:43,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:43,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:43,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:36:43,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:36:43,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:43,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:36:43,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:36:43,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:36:43,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:36:43,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:43,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:36:43,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:36:43,667 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:36:43,668 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:36:43,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:36:43,672 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:43,824 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:36:43,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:36:43 BoogieIcfgContainer [2025-03-17 05:36:43,827 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:36:43,827 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:36:43,827 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:36:43,827 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:36:43,831 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:36:35" (3/4) ... [2025-03-17 05:36:43,833 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:36:43,833 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:36:43,837 INFO L158 Benchmark]: Toolchain (without parser) took 9284.48ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 113.9MB in the beginning and 149.0MB in the end (delta: -35.2MB). Peak memory consumption was 93.7MB. Max. memory is 16.1GB. [2025-03-17 05:36:43,837 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:36:43,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.24ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 99.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:36:43,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.34ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 95.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:36:43,837 INFO L158 Benchmark]: Boogie Preprocessor took 60.93ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 90.8MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:36:43,838 INFO L158 Benchmark]: IcfgBuilder took 554.79ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 54.2MB in the end (delta: 36.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:36:43,838 INFO L158 Benchmark]: TraceAbstraction took 8351.07ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 53.7MB in the beginning and 149.1MB in the end (delta: -95.4MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2025-03-17 05:36:43,838 INFO L158 Benchmark]: Witness Printer took 5.87ms. Allocated memory is still 268.4MB. Free memory was 149.1MB in the beginning and 149.0MB in the end (delta: 54.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:36:43,839 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.24ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.24ms. Allocated memory is still 142.6MB. Free memory was 113.9MB in the beginning and 99.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.34ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 95.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.93ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 90.8MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 554.79ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 54.2MB in the end (delta: 36.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8351.07ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 53.7MB in the beginning and 149.1MB in the end (delta: -95.4MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Witness Printer took 5.87ms. Allocated memory is still 268.4MB. Free memory was 149.1MB in the beginning and 149.0MB in the end (delta: 54.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 81, overapproximation of shiftRight at line 81, overapproximation of someBinaryArithmeticDOUBLEoperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 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] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L27-L29] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L27-L29] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L27-L29] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L27-L29] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L27-L29] double double_Array_0[5] = { 1.8, 63.5, 0.25, 256.75, 16.5 }; [L30] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L31] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L32] double* double_Array_0_arraydouble_Array_0arrayVar2_Pointer = &(double_Array_0[2]); [L33] double* double_Array_0_arraydouble_Array_0arrayVar3_Pointer = &(double_Array_0[3]); [L34] double* double_Array_0_arraydouble_Array_0arrayVar4_Pointer = &(double_Array_0[4]); [L35-L37] float float_Array_0[1] = { 4.6 }; [L35-L37] float float_Array_0[1] = { 4.6 }; [L38] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L39-L41] signed long int signed_long_int_Array_0[1] = { -5 }; [L39-L41] signed long int signed_long_int_Array_0[1] = { -5 }; [L42] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L43-L45] unsigned char unsigned_char_Array_0[3] = { 2, 128, 100 }; [L43-L45] unsigned char unsigned_char_Array_0[3] = { 2, 128, 100 }; [L43-L45] unsigned char unsigned_char_Array_0[3] = { 2, 128, 100 }; [L43-L45] unsigned char unsigned_char_Array_0[3] = { 2, 128, 100 }; [L46] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L47] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L48] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[2]); [L49-L51] unsigned long int unsigned_long_int_Array_0[1] = { 500 }; [L49-L51] unsigned long int unsigned_long_int_Array_0[1] = { 500 }; [L52] unsigned long int* unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer = &(unsigned_long_int_Array_0[0]); [L53-L55] unsigned short int unsigned_short_int_Array_0[1] = { 10 }; [L53-L55] unsigned short int unsigned_short_int_Array_0[1] = { 10 }; [L56] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L57] signed long int last_1_signed_long_int_Array_0_0_ = -5; [L58] unsigned char last_1_unsigned_char_Array_0_0_ = 2; [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L114] EXPR signed_long_int_Array_0[0] [L114] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L115] EXPR unsigned_char_Array_0[0] [L115] last_1_unsigned_char_Array_0_0_ = unsigned_char_Array_0[0] [L125] RET updateLastVariables() [L126] CALL updateVariables() [L92] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L93] 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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L93] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L94] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L94] 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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L94] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L95] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L96] 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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L96] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L97] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L97] 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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L97] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L98] double_Array_0[0] = __VERIFIER_nondet_double() [L99] EXPR double_Array_0[0] [L99] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L99] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L99] EXPR double_Array_0[0] [L99] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L99] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L99] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L99] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L99] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 2305843.009213691390e+12F && double_Array_0[0] >= 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L100] double_Array_0[1] = __VERIFIER_nondet_double() [L101] EXPR double_Array_0[1] [L101] EXPR double_Array_0[1] >= 0.0F && double_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L101] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L101] EXPR double_Array_0[1] [L101] EXPR double_Array_0[1] >= 0.0F && double_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L101] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 2305843.009213691390e+12F && double_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L101] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 2305843.009213691390e+12F && double_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L101] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 2305843.009213691390e+12F && double_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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L101] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 2305843.009213691390e+12F && double_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L102] double_Array_0[2] = __VERIFIER_nondet_double() [L103] EXPR double_Array_0[2] [L103] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L103] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F [L103] EXPR double_Array_0[2] [L103] EXPR double_Array_0[2] >= 0.0F && double_Array_0[2] <= -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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L103] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L103] EXPR (double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L103] CALL assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L103] RET assume_abort_if_not((double_Array_0[2] >= 0.0F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 4611686.018427382800e+12F && double_Array_0[2] >= 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L104] double_Array_0[4] = __VERIFIER_nondet_double() [L105] EXPR double_Array_0[4] [L105] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L105] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L105] EXPR double_Array_0[4] [L105] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L105] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L105] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L105] CALL assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L105] RET assume_abort_if_not((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L106] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L107] CALL assume_abort_if_not(unsigned_char_Array_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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L107] RET assume_abort_if_not(unsigned_char_Array_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L108] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L108] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 255) 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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L108] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 255) 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L109] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L110] EXPR unsigned_char_Array_0[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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L110] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L110] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L111] EXPR unsigned_char_Array_0[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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L111] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [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, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L111] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L126] RET updateVariables() [L127] CALL step() [L62] unsigned char stepLocal_1 = last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_; [L63] signed long int stepLocal_0 = last_1_unsigned_char_Array_0_0_; [L64] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L64] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L65] stepLocal_1 && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, stepLocal_0=2, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L65] stepLocal_1 && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L65] COND FALSE !(stepLocal_1 && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) [L75] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L75] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L76] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L76] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L76] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L76] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar4_Pointer) [L76] (*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)) = ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))) [L78] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L78] (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) [L79] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L79] (*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) [L80] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L80] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) [L81] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L81] EXPR -4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, stepLocal_0=2, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L81] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L81] EXPR (((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer))) [L81] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L81] EXPR -4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, stepLocal_0=2, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L81] EXPR (((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, stepLocal_0=2, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L81] signed long int stepLocal_3 = ((((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))); [L82] EXPR \read(*unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer) [L82] signed long int stepLocal_2 = (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / -8; [L83] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L83] COND FALSE !((~ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) <= stepLocal_3) [L88] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L88] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L88] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) = ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L127] RET step() [L128] CALL, EXPR property() [L118] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_unsigned_char_Array_0_0_)) [L118] EXPR (last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR (last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1 [L118] EXPR ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)) == ((double) ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar4_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)) == ((double) ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))))) : 1) [L118] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)) == ((double) ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))))) : 1 [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar3_Pointer) [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar2_Pointer) [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar4_Pointer) [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)) == ((double) ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar4_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)) == ((double) ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar4_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)) == ((double) ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))))) : 1)) && (((~ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) <= (((((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - 64) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / -8)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : 1) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)) == ((double) ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))))) : 1)) && (((~ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) <= (((((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - 64) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / -8)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : 1) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)) == ((double) ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))))) : 1)) && (((~ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) <= (((((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - 64) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / -8)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : 1) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(double_Array_0_arraydouble_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)) == ((double) ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))))) : 1)) && (((~ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) <= (((((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - 64) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / -8)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : 1) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(double_Array_0_arraydouble_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)) == ((double) ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))))) : 1)) && (((~ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) <= (((((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - 64) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / -8)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : 1) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) && ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)) == ((double) ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))))) : 1)) && (((~ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) <= (((((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - 64) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / -8)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : 1) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) && ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)) == ((double) ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))))) : 1)) && (((~ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) <= (((((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - 64) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / -8)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : 1) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) && ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118] EXPR ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)) == ((double) ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))))) : 1)) && (((~ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) <= (((((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - 64) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / -8)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : 1) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) && ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [L118-L119] return ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? (((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) && (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((last_1_signed_long_int_Array_0_0_ >= last_1_unsigned_char_Array_0_0_) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) 5)) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) ((((25) < (last_1_unsigned_char_Array_0_0_)) ? (25) : (last_1_unsigned_char_Array_0_0_)))))) : 1) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) last_1_unsigned_char_Array_0_0_))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) ? ((*(double_Array_0_arraydouble_Array_0arrayVar3_Pointer)) == ((double) ((((*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) + (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) + (*(double_Array_0_arraydouble_Array_0arrayVar2_Pointer))) - (*(double_Array_0_arraydouble_Array_0arrayVar4_Pointer))))) : 1)) && (((~ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer))) <= (((((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) ? ((-4 >> (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))))) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) - 64) < ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) / -8)) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)))) : 1) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) - (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)) == ((float) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) && ((*(unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer)) == ((unsigned long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ; [L128] RET, EXPR property() [L128] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] [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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, double_Array_0_arraydouble_Array_0arrayVar2_Pointer={5:16}, double_Array_0_arraydouble_Array_0arrayVar3_Pointer={5:24}, double_Array_0_arraydouble_Array_0arrayVar4_Pointer={5:32}, float_Array_0={6:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={6:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=-5, last_1_unsigned_char_Array_0_0_=2, signed_long_int_Array_0={7:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={8:2}, unsigned_long_int_Array_0={9:0}, unsigned_long_int_Array_0_arrayunsigned_long_int_Array_0Var0_Pointer={9:0}, unsigned_short_int_Array_0={10:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 167 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 17, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1523 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1523 mSDsluCounter, 8967 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6414 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1287 IncrementalHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 2553 mSDtfsCounter, 1287 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=610occurred in iteration=14, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 774 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2418 NumberOfCodeBlocks, 2418 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2276 ConstructedInterpolants, 0 QuantifiedInterpolants, 3685 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1988 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 5159/5280 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:36:43,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-55.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 0de8f92e263c447336155b650efb70abf388c63a83fbed90771c90584f080fb9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:36:45,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:36:45,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:36:45,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:36:45,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:36:45,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:36:45,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:36:46,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:36:46,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:36:46,000 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:36:46,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:36:46,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:36:46,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:36:46,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:36:46,002 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:36:46,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:36:46,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:36:46,002 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:36:46,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:36:46,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:36:46,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:36:46,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:36:46,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:36:46,003 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:36:46,003 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:36:46,003 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:36:46,003 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:36:46,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:36:46,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:36:46,003 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:36:46,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:36:46,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:36:46,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:36:46,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:36:46,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:36:46,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:36:46,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:36:46,004 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:36:46,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:36:46,004 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:36:46,004 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:36:46,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:36:46,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:36:46,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:36:46,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:36:46,005 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 -> 0de8f92e263c447336155b650efb70abf388c63a83fbed90771c90584f080fb9 [2025-03-17 05:36:46,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:36:46,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:36:46,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:36:46,259 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:36:46,259 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:36:46,260 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-55.i [2025-03-17 05:36:47,568 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94e76918/773fc771fa6f4a868a423386edb8a493/FLAG44e2f7f05 [2025-03-17 05:36:47,796 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:36:47,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-55.i [2025-03-17 05:36:47,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94e76918/773fc771fa6f4a868a423386edb8a493/FLAG44e2f7f05 [2025-03-17 05:36:47,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c94e76918/773fc771fa6f4a868a423386edb8a493 [2025-03-17 05:36:47,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:36:47,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:36:47,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:36:47,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:36:47,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:36:47,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:36:47" (1/1) ... [2025-03-17 05:36:47,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a21801a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:47, skipping insertion in model container [2025-03-17 05:36:47,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:36:47" (1/1) ... [2025-03-17 05:36:47,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:36:47,962 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-55.i[917,930] [2025-03-17 05:36:48,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:36:48,053 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:36:48,063 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-55.i[917,930] [2025-03-17 05:36:48,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:36:48,122 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:36:48,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:48 WrapperNode [2025-03-17 05:36:48,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:36:48,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:36:48,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:36:48,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:36:48,129 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:36:48" (1/1) ... [2025-03-17 05:36:48,147 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:36:48" (1/1) ... [2025-03-17 05:36:48,184 INFO L138 Inliner]: procedures = 39, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 438 [2025-03-17 05:36:48,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:36:48,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:36:48,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:36:48,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:36:48,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:48" (1/1) ... [2025-03-17 05:36:48,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:48" (1/1) ... [2025-03-17 05:36:48,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:48" (1/1) ... [2025-03-17 05:36:48,237 INFO L175 MemorySlicer]: Split 108 memory accesses to 8 slices as follows [2, 14, 37, 3, 6, 24, 3, 19]. 34 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 2, 5, 1, 1, 3, 1, 1]. The 17 writes are split as follows [0, 2, 5, 1, 2, 3, 1, 3]. [2025-03-17 05:36:48,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:48" (1/1) ... [2025-03-17 05:36:48,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:48" (1/1) ... [2025-03-17 05:36:48,270 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:48" (1/1) ... [2025-03-17 05:36:48,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:48" (1/1) ... [2025-03-17 05:36:48,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:48" (1/1) ... [2025-03-17 05:36:48,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:48" (1/1) ... [2025-03-17 05:36:48,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:36:48,299 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:36:48,299 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:36:48,299 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:36:48,300 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:48" (1/1) ... [2025-03-17 05:36:48,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:36:48,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:48,331 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:36:48,334 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:36:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:36:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:36:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:36:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:36:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:36:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:36:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-17 05:36:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-17 05:36:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-03-17 05:36:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:36:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:36:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:36:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:36:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:36:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-17 05:36:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-17 05:36:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-03-17 05:36:48,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:36:48,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:36:48,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:36:48,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:36:48,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:36:48,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:36:48,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:36:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-17 05:36:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:36:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:36:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:36:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:36:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:36:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:36:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-17 05:36:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-17 05:36:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:36:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:36:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:36:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:36:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:36:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:36:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:36:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-17 05:36:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:36:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:36:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:36:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:36:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:36:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:36:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:36:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-17 05:36:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:36:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:36:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:36:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:36:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:36:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:36:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-17 05:36:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-17 05:36:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:36:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:36:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-17 05:36:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:36:48,359 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:36:48,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:36:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:36:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:36:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:36:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:36:48,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-17 05:36:48,533 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:36:48,535 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:36:55,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem72#1;havoc property_#t~ite80#1;havoc property_#t~mem73#1;havoc property_#t~short74#1;havoc property_#t~ite78#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite103#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~short104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short107#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~short110#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1; [2025-03-17 05:36:55,847 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-03-17 05:36:55,848 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:36:55,855 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:36:55,856 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:36:55,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:36:55 BoogieIcfgContainer [2025-03-17 05:36:55,856 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:36:55,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:36:55,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:36:55,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:36:55,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:36:47" (1/3) ... [2025-03-17 05:36:55,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13075145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:36:55, skipping insertion in model container [2025-03-17 05:36:55,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:48" (2/3) ... [2025-03-17 05:36:55,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13075145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:36:55, skipping insertion in model container [2025-03-17 05:36:55,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:36:55" (3/3) ... [2025-03-17 05:36:55,864 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-55.i [2025-03-17 05:36:55,875 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:36:55,877 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-55.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:36:55,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:36:55,931 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;@1666a804, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:36:55,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:36:55,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:36:55,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:36:55,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:55,941 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:55,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:55,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:55,945 INFO L85 PathProgramCache]: Analyzing trace with hash -731718965, now seen corresponding path program 1 times [2025-03-17 05:36:55,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:36:55,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851540473] [2025-03-17 05:36:55,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:55,953 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:36:55,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:36:55,957 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:36:55,958 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:36:56,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:36:56,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:36:56,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:56,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:56,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:36:56,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-17 05:36:56,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:36:56,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:36:56,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851540473] [2025-03-17 05:36:56,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851540473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:56,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:56,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:36:56,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874447411] [2025-03-17 05:36:56,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:56,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:36:56,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:36:56,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:36:56,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:36:56,619 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:36:56,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:56,639 INFO L93 Difference]: Finished difference Result 183 states and 288 transitions. [2025-03-17 05:36:56,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:36:56,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-03-17 05:36:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:56,647 INFO L225 Difference]: With dead ends: 183 [2025-03-17 05:36:56,647 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 05:36:56,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 108 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:36:56,651 INFO L435 NwaCegarLoop]: 133 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, 133 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:36:56,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 05:36:56,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-17 05:36:56,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:36:56,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2025-03-17 05:36:56,682 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 109 [2025-03-17 05:36:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:56,682 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2025-03-17 05:36:56,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:36:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2025-03-17 05:36:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:36:56,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:56,684 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:56,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:36:56,885 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:36:56,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:56,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:56,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1182567405, now seen corresponding path program 1 times [2025-03-17 05:36:56,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:36:56,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301764230] [2025-03-17 05:36:56,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:56,887 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:36:56,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:36:56,889 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:36:56,890 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:36:57,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:36:57,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:36:57,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:57,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:57,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:36:57,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 05:36:58,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:36:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:36:58,578 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:36:58,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301764230] [2025-03-17 05:36:58,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301764230] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:58,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:36:58,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-17 05:36:58,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036912970] [2025-03-17 05:36:58,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:58,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:36:58,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:36:58,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:36:58,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:36:58,582 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:01,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:01,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:01,204 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2025-03-17 05:37:01,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:01,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-03-17 05:37:01,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:01,208 INFO L225 Difference]: With dead ends: 219 [2025-03-17 05:37:01,208 INFO L226 Difference]: Without dead ends: 129 [2025-03-17 05:37:01,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:37:01,212 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 102 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:01,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 368 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-17 05:37:01,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-17 05:37:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 93. [2025-03-17 05:37:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:37:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-03-17 05:37:01,221 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 109 [2025-03-17 05:37:01,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:01,226 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-03-17 05:37:01,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-03-17 05:37:01,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:37:01,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:01,227 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:01,247 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:37:01,428 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:37:01,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:01,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:01,429 INFO L85 PathProgramCache]: Analyzing trace with hash -971216492, now seen corresponding path program 1 times [2025-03-17 05:37:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:37:01,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541553035] [2025-03-17 05:37:01,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:01,430 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:37:01,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:37:01,435 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:37:01,437 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:37:01,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:37:01,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:37:01,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:01,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:01,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:37:01,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:01,815 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:37:02,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 05:37:02,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2025-03-17 05:37:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:37:02,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:37:02,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:37:02,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541553035] [2025-03-17 05:37:02,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541553035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:02,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:02,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:37:02,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381234392] [2025-03-17 05:37:02,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:02,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:37:02,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:37:02,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:37:02,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:37:02,206 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:02,959 INFO L93 Difference]: Finished difference Result 318 states and 460 transitions. [2025-03-17 05:37:02,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:37:02,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-03-17 05:37:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:02,963 INFO L225 Difference]: With dead ends: 318 [2025-03-17 05:37:02,963 INFO L226 Difference]: Without dead ends: 226 [2025-03-17 05:37:02,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:37:02,964 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 203 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:02,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 741 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:37:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-17 05:37:02,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 159. [2025-03-17 05:37:02,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.393939393939394) internal successors, (184), 132 states have internal predecessors, (184), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:37:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 232 transitions. [2025-03-17 05:37:02,997 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 232 transitions. Word has length 109 [2025-03-17 05:37:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:02,998 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 232 transitions. [2025-03-17 05:37:02,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:02,998 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 232 transitions. [2025-03-17 05:37:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:37:03,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:03,000 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:03,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:37:03,200 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:37:03,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:03,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:03,201 INFO L85 PathProgramCache]: Analyzing trace with hash 904098001, now seen corresponding path program 1 times [2025-03-17 05:37:03,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:37:03,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120908024] [2025-03-17 05:37:03,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:03,202 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:37:03,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:37:03,204 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:37:03,206 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:37:03,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:37:03,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:37:03,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:03,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:03,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:37:03,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:37:04,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:37:04,053 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:37:04,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120908024] [2025-03-17 05:37:04,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120908024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:04,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:04,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:37:04,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592251650] [2025-03-17 05:37:04,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:04,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:37:04,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:37:04,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:37:04,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:37:04,054 INFO L87 Difference]: Start difference. First operand 159 states and 232 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:04,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:04,355 INFO L93 Difference]: Finished difference Result 395 states and 571 transitions. [2025-03-17 05:37:04,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:37:04,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-17 05:37:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:04,358 INFO L225 Difference]: With dead ends: 395 [2025-03-17 05:37:04,358 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 05:37:04,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:37:04,359 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 206 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:04,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 727 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:37:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 05:37:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 253. [2025-03-17 05:37:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 213 states have (on average 1.375586854460094) internal successors, (293), 213 states have internal predecessors, (293), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:37:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 365 transitions. [2025-03-17 05:37:04,379 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 365 transitions. Word has length 111 [2025-03-17 05:37:04,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:04,380 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 365 transitions. [2025-03-17 05:37:04,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 365 transitions. [2025-03-17 05:37:04,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:37:04,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:04,381 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:04,399 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:37:04,581 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:37:04,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:04,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:04,582 INFO L85 PathProgramCache]: Analyzing trace with hash 837091248, now seen corresponding path program 1 times [2025-03-17 05:37:04,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:37:04,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53170690] [2025-03-17 05:37:04,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:04,583 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:37:04,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:37:04,586 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:37:04,587 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:37:04,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:37:05,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:37:05,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:05,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:05,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:37:05,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:05,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 05:37:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 05:37:05,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:37:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:37:06,066 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:37:06,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53170690] [2025-03-17 05:37:06,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53170690] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:37:06,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:37:06,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-03-17 05:37:06,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482678190] [2025-03-17 05:37:06,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:06,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:06,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:37:06,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:06,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:37:06,067 INFO L87 Difference]: Start difference. First operand 253 states and 365 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:06,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:06,231 INFO L93 Difference]: Finished difference Result 515 states and 742 transitions. [2025-03-17 05:37:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:06,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-17 05:37:06,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:06,237 INFO L225 Difference]: With dead ends: 515 [2025-03-17 05:37:06,238 INFO L226 Difference]: Without dead ends: 328 [2025-03-17 05:37:06,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:37:06,239 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 98 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 457 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:06,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 457 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-17 05:37:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 269. [2025-03-17 05:37:06,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 229 states have (on average 1.3668122270742358) internal successors, (313), 229 states have internal predecessors, (313), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:37:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 385 transitions. [2025-03-17 05:37:06,276 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 385 transitions. Word has length 111 [2025-03-17 05:37:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:06,276 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 385 transitions. [2025-03-17 05:37:06,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:06,276 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 385 transitions. [2025-03-17 05:37:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:37:06,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:06,277 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:06,296 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:37:06,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:37:06,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:06,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:06,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1136518798, now seen corresponding path program 1 times [2025-03-17 05:37:06,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:37:06,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909378875] [2025-03-17 05:37:06,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:06,479 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:37:06,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:37:06,480 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:37:06,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 05:37:06,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:37:06,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:37:06,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:06,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:06,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:37:06,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 05:37:07,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:37:07,714 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:37:07,715 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:37:07,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909378875] [2025-03-17 05:37:07,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909378875] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:37:07,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:37:07,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-17 05:37:07,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809525179] [2025-03-17 05:37:07,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:07,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:07,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:37:07,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:07,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:37:07,716 INFO L87 Difference]: Start difference. First operand 269 states and 385 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:09,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:09,958 INFO L93 Difference]: Finished difference Result 531 states and 759 transitions. [2025-03-17 05:37:09,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:09,959 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-17 05:37:09,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:09,960 INFO L225 Difference]: With dead ends: 531 [2025-03-17 05:37:09,961 INFO L226 Difference]: Without dead ends: 328 [2025-03-17 05:37:09,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:37:09,962 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 82 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:09,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 366 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 05:37:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-17 05:37:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 288. [2025-03-17 05:37:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 248 states have (on average 1.375) internal successors, (341), 248 states have internal predecessors, (341), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:37:09,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 413 transitions. [2025-03-17 05:37:09,983 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 413 transitions. Word has length 111 [2025-03-17 05:37:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:09,983 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 413 transitions. [2025-03-17 05:37:09,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 413 transitions. [2025-03-17 05:37:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-17 05:37:09,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:09,988 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:10,006 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 (7)] Forceful destruction successful, exit code 0 [2025-03-17 05:37:10,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:37:10,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:10,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:10,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1642077423, now seen corresponding path program 1 times [2025-03-17 05:37:10,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:37:10,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101561387] [2025-03-17 05:37:10,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:10,190 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:37:10,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:37:10,191 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:37:10,192 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:37:10,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-17 05:37:10,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-17 05:37:10,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:10,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:10,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:37:10,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:37:10,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:37:10,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:37:10,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101561387] [2025-03-17 05:37:10,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101561387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:10,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:10,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:37:10,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13030656] [2025-03-17 05:37:10,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:10,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:10,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:37:10,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:10,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:37:10,523 INFO L87 Difference]: Start difference. First operand 288 states and 413 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:14,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:14,269 INFO L93 Difference]: Finished difference Result 516 states and 740 transitions. [2025-03-17 05:37:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:14,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-03-17 05:37:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:14,272 INFO L225 Difference]: With dead ends: 516 [2025-03-17 05:37:14,272 INFO L226 Difference]: Without dead ends: 294 [2025-03-17 05:37:14,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 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:37:14,273 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:14,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 503 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-17 05:37:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-17 05:37:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-03-17 05:37:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 254 states have (on average 1.3661417322834646) internal successors, (347), 254 states have internal predecessors, (347), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:37:14,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 419 transitions. [2025-03-17 05:37:14,289 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 419 transitions. Word has length 111 [2025-03-17 05:37:14,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:14,289 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 419 transitions. [2025-03-17 05:37:14,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 419 transitions. [2025-03-17 05:37:14,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:37:14,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:14,290 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:14,299 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:37:14,490 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:37:14,490 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:14,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:14,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1747440033, now seen corresponding path program 1 times [2025-03-17 05:37:14,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:37:14,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518038255] [2025-03-17 05:37:14,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:14,491 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:37:14,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:37:14,493 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:37:14,494 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:37:14,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:37:14,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:37:14,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:14,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:14,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:37:14,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 132 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 05:37:15,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:37:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:37:15,305 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:37:15,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518038255] [2025-03-17 05:37:15,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518038255] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:37:15,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:37:15,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-17 05:37:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650569943] [2025-03-17 05:37:15,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:15,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:15,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:37:15,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:15,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:37:15,306 INFO L87 Difference]: Start difference. First operand 294 states and 419 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:15,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:15,426 INFO L93 Difference]: Finished difference Result 553 states and 781 transitions. [2025-03-17 05:37:15,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:15,427 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2025-03-17 05:37:15,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:15,429 INFO L225 Difference]: With dead ends: 553 [2025-03-17 05:37:15,429 INFO L226 Difference]: Without dead ends: 325 [2025-03-17 05:37:15,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 213 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:37:15,430 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 35 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:15,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 519 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:15,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-03-17 05:37:15,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 279. [2025-03-17 05:37:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 239 states have (on average 1.3389121338912133) internal successors, (320), 239 states have internal predecessors, (320), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:37:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 392 transitions. [2025-03-17 05:37:15,447 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 392 transitions. Word has length 112 [2025-03-17 05:37:15,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:15,447 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 392 transitions. [2025-03-17 05:37:15,447 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 392 transitions. [2025-03-17 05:37:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:37:15,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:15,449 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:15,463 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:37:15,649 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:37:15,650 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:15,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:15,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2068615875, now seen corresponding path program 1 times [2025-03-17 05:37:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:37:15,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354977250] [2025-03-17 05:37:15,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:15,651 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:37:15,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:37:15,652 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:37:15,653 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:37:15,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:37:16,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:37:16,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:16,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:16,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:37:16,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:37:16,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:37:16,350 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:37:16,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354977250] [2025-03-17 05:37:16,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354977250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:16,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:16,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:37:16,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449928953] [2025-03-17 05:37:16,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:16,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:16,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:37:16,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:16,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:37:16,351 INFO L87 Difference]: Start difference. First operand 279 states and 392 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:16,571 INFO L93 Difference]: Finished difference Result 525 states and 734 transitions. [2025-03-17 05:37:16,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:37:16,572 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2025-03-17 05:37:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:16,574 INFO L225 Difference]: With dead ends: 525 [2025-03-17 05:37:16,574 INFO L226 Difference]: Without dead ends: 312 [2025-03-17 05:37:16,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:37:16,576 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 159 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:16,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 557 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:37:16,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-17 05:37:16,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 276. [2025-03-17 05:37:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 236 states have (on average 1.326271186440678) internal successors, (313), 236 states have internal predecessors, (313), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:37:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 385 transitions. [2025-03-17 05:37:16,587 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 385 transitions. Word has length 114 [2025-03-17 05:37:16,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:16,587 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 385 transitions. [2025-03-17 05:37:16,587 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:16,587 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 385 transitions. [2025-03-17 05:37:16,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:37:16,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:16,588 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:16,608 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:37:16,793 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:37:16,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:16,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:16,793 INFO L85 PathProgramCache]: Analyzing trace with hash -873041724, now seen corresponding path program 1 times [2025-03-17 05:37:16,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:37:16,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519198544] [2025-03-17 05:37:16,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:16,794 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:37:16,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:37:16,796 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:37:16,796 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:37:16,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:37:17,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:37:17,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:17,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:17,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:37:17,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:37:17,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:37:17,304 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:37:17,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519198544] [2025-03-17 05:37:17,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519198544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:17,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:17,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:37:17,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32435689] [2025-03-17 05:37:17,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:17,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:17,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:37:17,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:17,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:37:17,305 INFO L87 Difference]: Start difference. First operand 276 states and 385 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:17,373 INFO L93 Difference]: Finished difference Result 489 states and 682 transitions. [2025-03-17 05:37:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:17,374 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2025-03-17 05:37:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:17,375 INFO L225 Difference]: With dead ends: 489 [2025-03-17 05:37:17,375 INFO L226 Difference]: Without dead ends: 279 [2025-03-17 05:37:17,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 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:37:17,376 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 510 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:17,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 510 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-17 05:37:17,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-03-17 05:37:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 239 states have (on average 1.3179916317991631) internal successors, (315), 239 states have internal predecessors, (315), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:37:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 387 transitions. [2025-03-17 05:37:17,387 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 387 transitions. Word has length 114 [2025-03-17 05:37:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:17,387 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 387 transitions. [2025-03-17 05:37:17,387 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:37:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 387 transitions. [2025-03-17 05:37:17,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:37:17,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:17,389 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:17,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-17 05:37:17,590 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:37:17,590 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:17,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:17,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1369739700, now seen corresponding path program 1 times [2025-03-17 05:37:17,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:37:17,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933465545] [2025-03-17 05:37:17,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:17,591 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:37:17,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:37:17,592 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:37:17,593 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:37:17,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:37:17,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:37:17,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:17,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:17,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:37:17,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:18,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:37:18,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2025-03-17 05:37:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-17 05:37:18,178 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:37:18,179 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:37:18,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933465545] [2025-03-17 05:37:18,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933465545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:18,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:18,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:37:18,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280376030] [2025-03-17 05:37:18,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:18,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:37:18,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:37:18,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:37:18,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:37:18,180 INFO L87 Difference]: Start difference. First operand 279 states and 387 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:37:21,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:24,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:26,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:28,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:28,690 INFO L93 Difference]: Finished difference Result 546 states and 755 transitions. [2025-03-17 05:37:28,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:37:28,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-03-17 05:37:28,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:28,698 INFO L225 Difference]: With dead ends: 546 [2025-03-17 05:37:28,698 INFO L226 Difference]: Without dead ends: 282 [2025-03-17 05:37:28,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:37:28,699 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 115 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:28,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 408 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2025-03-17 05:37:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-17 05:37:28,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2025-03-17 05:37:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 239 states have (on average 1.3054393305439331) internal successors, (312), 239 states have internal predecessors, (312), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:37:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 384 transitions. [2025-03-17 05:37:28,710 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 384 transitions. Word has length 114 [2025-03-17 05:37:28,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:28,710 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 384 transitions. [2025-03-17 05:37:28,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:37:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 384 transitions. [2025-03-17 05:37:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:37:28,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:28,711 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:28,722 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:37:28,911 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:37:28,912 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:28,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:28,912 INFO L85 PathProgramCache]: Analyzing trace with hash 973880407, now seen corresponding path program 1 times [2025-03-17 05:37:28,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:37:28,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590276948] [2025-03-17 05:37:28,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:28,912 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:37:28,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:37:28,914 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:37:28,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 (13)] Waiting until timeout for monitored process [2025-03-17 05:37:29,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:37:29,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:37:29,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:29,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:29,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:37:29,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:37:29,237 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:37:29,237 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:37:29,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590276948] [2025-03-17 05:37:29,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590276948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:29,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:29,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:37:29,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509725067] [2025-03-17 05:37:29,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:29,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:37:29,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:37:29,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:37:29,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:37:29,238 INFO L87 Difference]: Start difference. First operand 279 states and 384 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 05:37:29,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:29,384 INFO L93 Difference]: Finished difference Result 554 states and 760 transitions. [2025-03-17 05:37:29,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:37:29,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2025-03-17 05:37:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:29,386 INFO L225 Difference]: With dead ends: 554 [2025-03-17 05:37:29,386 INFO L226 Difference]: Without dead ends: 285 [2025-03-17 05:37:29,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:37:29,387 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:29,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 549 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:29,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-17 05:37:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 279. [2025-03-17 05:37:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 239 states have (on average 1.292887029288703) internal successors, (309), 239 states have internal predecessors, (309), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:37:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 381 transitions. [2025-03-17 05:37:29,399 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 381 transitions. Word has length 116 [2025-03-17 05:37:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:29,399 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 381 transitions. [2025-03-17 05:37:29,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 05:37:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 381 transitions. [2025-03-17 05:37:29,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 05:37:29,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:29,400 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:29,410 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 (13)] Forceful destruction successful, exit code 0 [2025-03-17 05:37:29,600 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:37:29,600 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:29,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:29,601 INFO L85 PathProgramCache]: Analyzing trace with hash -880465130, now seen corresponding path program 1 times [2025-03-17 05:37:29,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:37:29,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42487150] [2025-03-17 05:37:29,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:29,601 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:37:29,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:37:29,605 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:37:29,605 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:37:29,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 05:37:29,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 05:37:29,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:29,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:29,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:37:29,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:30,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:37:30,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-17 05:37:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 05:37:30,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:37:30,196 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:37:30,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42487150] [2025-03-17 05:37:30,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42487150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:30,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:30,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:37:30,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702567841] [2025-03-17 05:37:30,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:30,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:37:30,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:37:30,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:37:30,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:37:30,197 INFO L87 Difference]: Start difference. First operand 279 states and 381 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:37:33,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:35,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:40,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:40,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:40,447 INFO L93 Difference]: Finished difference Result 539 states and 734 transitions. [2025-03-17 05:37:40,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:37:40,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-03-17 05:37:40,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:40,456 INFO L225 Difference]: With dead ends: 539 [2025-03-17 05:37:40,456 INFO L226 Difference]: Without dead ends: 282 [2025-03-17 05:37:40,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:37:40,457 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 106 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:40,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 400 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2025-03-17 05:37:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-17 05:37:40,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2025-03-17 05:37:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 239 states have (on average 1.2803347280334727) internal successors, (306), 239 states have internal predecessors, (306), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:37:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 378 transitions. [2025-03-17 05:37:40,468 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 378 transitions. Word has length 116 [2025-03-17 05:37:40,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:40,468 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 378 transitions. [2025-03-17 05:37:40,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:37:40,468 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 378 transitions. [2025-03-17 05:37:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:37:40,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:40,469 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:40,480 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:37:40,670 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:37:40,670 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:40,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:40,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1307507404, now seen corresponding path program 1 times [2025-03-17 05:37:40,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:37:40,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459994482] [2025-03-17 05:37:40,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:40,671 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:37:40,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:37:40,673 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:37:40,674 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:37:40,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:37:41,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:37:41,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:41,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:41,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:37:41,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:41,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:37:41,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-17 05:37:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 05:37:41,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:37:41,265 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:37:41,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459994482] [2025-03-17 05:37:41,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459994482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:41,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:41,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:37:41,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457812315] [2025-03-17 05:37:41,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:41,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:37:41,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:37:41,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:37:41,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:37:41,265 INFO L87 Difference]: Start difference. First operand 279 states and 378 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:37:44,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:47,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:49,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:51,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:51,979 INFO L93 Difference]: Finished difference Result 532 states and 718 transitions. [2025-03-17 05:37:51,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:37:51,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-03-17 05:37:51,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:51,986 INFO L225 Difference]: With dead ends: 532 [2025-03-17 05:37:51,986 INFO L226 Difference]: Without dead ends: 282 [2025-03-17 05:37:51,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:37:51,987 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 97 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:51,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 396 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2025-03-17 05:37:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-17 05:37:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2025-03-17 05:37:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 239 states have (on average 1.2677824267782427) internal successors, (303), 239 states have internal predecessors, (303), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:37:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 375 transitions. [2025-03-17 05:37:51,999 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 375 transitions. Word has length 118 [2025-03-17 05:37:51,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:51,999 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 375 transitions. [2025-03-17 05:37:51,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:37:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 375 transitions. [2025-03-17 05:37:52,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:37:52,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:52,000 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:52,011 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 (15)] Ended with exit code 0 [2025-03-17 05:37:52,200 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:37:52,201 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:52,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:52,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1299604630, now seen corresponding path program 1 times [2025-03-17 05:37:52,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:37:52,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094005751] [2025-03-17 05:37:52,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:52,202 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:37:52,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:37:52,203 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:37:52,204 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:37:52,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:37:52,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:37:52,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:52,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:52,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:37:52,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:52,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:37:52,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-17 05:37:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-17 05:37:52,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:37:52,884 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:37:52,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094005751] [2025-03-17 05:37:52,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094005751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:52,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:52,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:37:52,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12114287] [2025-03-17 05:37:52,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:52,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:37:52,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:37:52,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:37:52,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:37:52,885 INFO L87 Difference]: Start difference. First operand 279 states and 375 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:37:56,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:58,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:37:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:59,234 INFO L93 Difference]: Finished difference Result 525 states and 702 transitions. [2025-03-17 05:37:59,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:37:59,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-03-17 05:37:59,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:59,242 INFO L225 Difference]: With dead ends: 525 [2025-03-17 05:37:59,242 INFO L226 Difference]: Without dead ends: 282 [2025-03-17 05:37:59,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:37:59,244 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 87 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:59,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 389 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-03-17 05:37:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-17 05:37:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2025-03-17 05:37:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 239 states have (on average 1.2552301255230125) internal successors, (300), 239 states have internal predecessors, (300), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:37:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 372 transitions. [2025-03-17 05:37:59,258 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 372 transitions. Word has length 120 [2025-03-17 05:37:59,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:59,258 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 372 transitions. [2025-03-17 05:37:59,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:37:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 372 transitions. [2025-03-17 05:37:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:37:59,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:59,260 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:59,271 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:37:59,460 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:37:59,460 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:59,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:59,461 INFO L85 PathProgramCache]: Analyzing trace with hash -786118476, now seen corresponding path program 1 times [2025-03-17 05:37:59,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:37:59,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953844950] [2025-03-17 05:37:59,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:59,461 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:37:59,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:37:59,463 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:37:59,464 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:37:59,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:37:59,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:37:59,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:59,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:59,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:37:59,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:59,909 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:38:00,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-17 05:38:00,129 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 23 treesize of output 15 [2025-03-17 05:38:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:38:00,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:38:00,164 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:38:00,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953844950] [2025-03-17 05:38:00,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953844950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:00,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:00,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:38:00,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203337394] [2025-03-17 05:38:00,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:00,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:38:00,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:38:00,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:38:00,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:38:00,165 INFO L87 Difference]: Start difference. First operand 279 states and 372 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:38:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:01,088 INFO L93 Difference]: Finished difference Result 698 states and 925 transitions. [2025-03-17 05:38:01,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:38:01,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2025-03-17 05:38:01,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:01,090 INFO L225 Difference]: With dead ends: 698 [2025-03-17 05:38:01,090 INFO L226 Difference]: Without dead ends: 581 [2025-03-17 05:38:01,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:38:01,091 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 299 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:01,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 939 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:38:01,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-17 05:38:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 467. [2025-03-17 05:38:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 401 states have (on average 1.254364089775561) internal successors, (503), 401 states have internal predecessors, (503), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:38:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 623 transitions. [2025-03-17 05:38:01,106 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 623 transitions. Word has length 122 [2025-03-17 05:38:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:01,106 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 623 transitions. [2025-03-17 05:38:01,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:38:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 623 transitions. [2025-03-17 05:38:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:38:01,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:01,107 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:01,119 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:38:01,307 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 [2025-03-17 05:38:01,308 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:01,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:01,308 INFO L85 PathProgramCache]: Analyzing trace with hash 835416962, now seen corresponding path program 1 times [2025-03-17 05:38:01,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:38:01,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570698409] [2025-03-17 05:38:01,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:01,309 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:38:01,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:38:01,313 INFO L229 MonitoredProcess]: Starting monitored process 18 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:38:01,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-03-17 05:38:01,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:38:01,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:38:01,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:01,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:01,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:38:01,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:38:01,810 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:38:02,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-17 05:38:02,147 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 23 treesize of output 15 [2025-03-17 05:38:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:38:02,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:38:02,175 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:38:02,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570698409] [2025-03-17 05:38:02,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [570698409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:02,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:02,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:38:02,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793217104] [2025-03-17 05:38:02,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:02,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:38:02,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:38:02,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:38:02,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:38:02,176 INFO L87 Difference]: Start difference. First operand 467 states and 623 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:38:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:02,964 INFO L93 Difference]: Finished difference Result 980 states and 1301 transitions. [2025-03-17 05:38:02,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:38:02,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2025-03-17 05:38:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:02,967 INFO L225 Difference]: With dead ends: 980 [2025-03-17 05:38:02,967 INFO L226 Difference]: Without dead ends: 581 [2025-03-17 05:38:02,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:38:02,968 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 258 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:02,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 945 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:38:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-17 05:38:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 467. [2025-03-17 05:38:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 401 states have (on average 1.2493765586034913) internal successors, (501), 401 states have internal predecessors, (501), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:38:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 621 transitions. [2025-03-17 05:38:02,983 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 621 transitions. Word has length 123 [2025-03-17 05:38:02,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:02,983 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 621 transitions. [2025-03-17 05:38:02,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:38:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 621 transitions. [2025-03-17 05:38:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:38:02,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:02,985 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:02,995 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 (18)] Ended with exit code 0 [2025-03-17 05:38:03,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:38:03,185 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:03,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:03,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1409649570, now seen corresponding path program 1 times [2025-03-17 05:38:03,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:38:03,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453644082] [2025-03-17 05:38:03,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:03,186 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:38:03,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:38:03,188 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:38:03,189 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:38:03,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:38:03,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:38:03,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:03,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:03,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:38:03,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:38:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:38:03,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:38:03,880 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:38:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453644082] [2025-03-17 05:38:03,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453644082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:03,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:03,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:38:03,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072613850] [2025-03-17 05:38:03,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:03,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:38:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:38:03,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:38:03,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:38:03,881 INFO L87 Difference]: Start difference. First operand 467 states and 621 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:38:04,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:04,135 INFO L93 Difference]: Finished difference Result 878 states and 1170 transitions. [2025-03-17 05:38:04,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:38:04,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2025-03-17 05:38:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:04,137 INFO L225 Difference]: With dead ends: 878 [2025-03-17 05:38:04,137 INFO L226 Difference]: Without dead ends: 479 [2025-03-17 05:38:04,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 121 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:38:04,138 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:04,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 364 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:38:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-17 05:38:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 475. [2025-03-17 05:38:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 409 states have (on average 1.2444987775061125) internal successors, (509), 409 states have internal predecessors, (509), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:38:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 629 transitions. [2025-03-17 05:38:04,152 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 629 transitions. Word has length 124 [2025-03-17 05:38:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:04,152 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 629 transitions. [2025-03-17 05:38:04,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:38:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 629 transitions. [2025-03-17 05:38:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:38:04,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:04,153 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:04,175 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:38:04,354 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:38:04,354 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:04,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:04,355 INFO L85 PathProgramCache]: Analyzing trace with hash -397804893, now seen corresponding path program 1 times [2025-03-17 05:38:04,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:38:04,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933923167] [2025-03-17 05:38:04,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:04,355 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:38:04,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:38:04,357 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:38:04,357 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:38:04,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:38:04,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:38:04,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:04,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:05,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:38:05,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:38:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:38:05,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:38:05,093 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:38:05,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933923167] [2025-03-17 05:38:05,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933923167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:05,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:05,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:38:05,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2756413] [2025-03-17 05:38:05,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:05,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:38:05,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:38:05,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:38:05,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:38:05,094 INFO L87 Difference]: Start difference. First operand 475 states and 629 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:38:05,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:05,302 INFO L93 Difference]: Finished difference Result 894 states and 1186 transitions. [2025-03-17 05:38:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:38:05,303 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2025-03-17 05:38:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:05,305 INFO L225 Difference]: With dead ends: 894 [2025-03-17 05:38:05,305 INFO L226 Difference]: Without dead ends: 487 [2025-03-17 05:38:05,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 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:38:05,305 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:05,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 477 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:38:05,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-03-17 05:38:05,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 483. [2025-03-17 05:38:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 417 states have (on average 1.2398081534772183) internal successors, (517), 417 states have internal predecessors, (517), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:38:05,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 637 transitions. [2025-03-17 05:38:05,319 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 637 transitions. Word has length 124 [2025-03-17 05:38:05,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:05,319 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 637 transitions. [2025-03-17 05:38:05,319 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:38:05,319 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 637 transitions. [2025-03-17 05:38:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:38:05,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:05,319 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:05,339 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 (20)] Ended with exit code 0 [2025-03-17 05:38:05,520 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:38:05,520 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:05,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:05,520 INFO L85 PathProgramCache]: Analyzing trace with hash 489698788, now seen corresponding path program 1 times [2025-03-17 05:38:05,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:38:05,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [944243642] [2025-03-17 05:38:05,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:05,521 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:38:05,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:38:05,523 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:38:05,524 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:38:05,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:38:06,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:38:06,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:38:06,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:38:06,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:38:06,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:38:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:38:06,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:38:06,285 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:38:06,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [944243642] [2025-03-17 05:38:06,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [944243642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:38:06,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:38:06,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:38:06,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390978535] [2025-03-17 05:38:06,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:38:06,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:38:06,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:38:06,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:38:06,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:38:06,286 INFO L87 Difference]: Start difference. First operand 483 states and 637 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:38:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:38:06,464 INFO L93 Difference]: Finished difference Result 910 states and 1202 transitions. [2025-03-17 05:38:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:38:06,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2025-03-17 05:38:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:38:06,467 INFO L225 Difference]: With dead ends: 910 [2025-03-17 05:38:06,467 INFO L226 Difference]: Without dead ends: 495 [2025-03-17 05:38:06,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 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:38:06,468 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:38:06,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 590 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:38:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-17 05:38:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 491. [2025-03-17 05:38:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 425 states have (on average 1.2352941176470589) internal successors, (525), 425 states have internal predecessors, (525), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:38:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 645 transitions. [2025-03-17 05:38:06,489 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 645 transitions. Word has length 124 [2025-03-17 05:38:06,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:38:06,490 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 645 transitions. [2025-03-17 05:38:06,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:38:06,490 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 645 transitions. [2025-03-17 05:38:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:38:06,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:38:06,490 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:06,511 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:38:06,695 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:38:06,695 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:38:06,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:38:06,696 INFO L85 PathProgramCache]: Analyzing trace with hash 490622309, now seen corresponding path program 1 times [2025-03-17 05:38:06,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:38:06,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596164441] [2025-03-17 05:38:06,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:38:06,697 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:38:06,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:38:06,699 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:38:06,701 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:38:06,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.