./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-9.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 6505c5086d29586e7ec0f5f77e8e039fa1bd40cb84198ddba96d37f8ed5ec1eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:34:13,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:34:13,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:34:13,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:34:13,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:34:13,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:34:13,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:34:13,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:34:13,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:34:13,889 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:34:13,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:34:13,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:34:13,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:34:13,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:34:13,890 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:34:13,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:34:13,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:34:13,891 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:34:13,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:34:13,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:34:13,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:34:13,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:34:13,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:34:13,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:34:13,891 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:34:13,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:34:13,891 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:34:13,891 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:34:13,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:34:13,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:34:13,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:34:13,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:34:13,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:34:13,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:34:13,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:34:13,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:34:13,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:34:13,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:34:13,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:34:13,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:34:13,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:34:13,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:34:13,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:34:13,892 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 -> 6505c5086d29586e7ec0f5f77e8e039fa1bd40cb84198ddba96d37f8ed5ec1eb [2025-03-08 16:34:14,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:34:14,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:34:14,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:34:14,132 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:34:14,132 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:34:14,133 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-9.i [2025-03-08 16:34:15,285 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31a00e88/97b9db468c9544379d009990d29d56b6/FLAG555456b66 [2025-03-08 16:34:15,537 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:34:15,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-9.i [2025-03-08 16:34:15,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31a00e88/97b9db468c9544379d009990d29d56b6/FLAG555456b66 [2025-03-08 16:34:15,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31a00e88/97b9db468c9544379d009990d29d56b6 [2025-03-08 16:34:15,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:34:15,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:34:15,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:34:15,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:34:15,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:34:15,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:34:15" (1/1) ... [2025-03-08 16:34:15,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22852b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:15, skipping insertion in model container [2025-03-08 16:34:15,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:34:15" (1/1) ... [2025-03-08 16:34:15,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:34:15,983 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-9.i[916,929] [2025-03-08 16:34:16,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:34:16,036 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:34:16,043 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-9.i[916,929] [2025-03-08 16:34:16,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:34:16,082 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:34:16,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:16 WrapperNode [2025-03-08 16:34:16,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:34:16,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:34:16,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:34:16,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:34:16,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:16" (1/1) ... [2025-03-08 16:34:16,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:16" (1/1) ... [2025-03-08 16:34:16,119 INFO L138 Inliner]: procedures = 29, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 356 [2025-03-08 16:34:16,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:34:16,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:34:16,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:34:16,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:34:16,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:16" (1/1) ... [2025-03-08 16:34:16,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:16" (1/1) ... [2025-03-08 16:34:16,132 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:16" (1/1) ... [2025-03-08 16:34:16,149 INFO L175 MemorySlicer]: Split 86 memory accesses to 6 slices as follows [2, 6, 22, 8, 17, 31]. 36 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 2, 1, 2, 3]. The 13 writes are split as follows [0, 1, 2, 1, 3, 6]. [2025-03-08 16:34:16,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:16" (1/1) ... [2025-03-08 16:34:16,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:16" (1/1) ... [2025-03-08 16:34:16,158 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:16" (1/1) ... [2025-03-08 16:34:16,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:16" (1/1) ... [2025-03-08 16:34:16,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:16" (1/1) ... [2025-03-08 16:34:16,168 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:16" (1/1) ... [2025-03-08 16:34:16,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:34:16,171 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:34:16,171 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:34:16,171 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:34:16,172 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:16" (1/1) ... [2025-03-08 16:34:16,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:34:16,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:34:16,195 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-08 16:34:16,197 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-08 16:34:16,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:34:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:34:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:34:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:34:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:34:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 16:34:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-08 16:34:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:34:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:34:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:34:16,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:34:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:34:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:34:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:34:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:34:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:34:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:34:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-08 16:34:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-08 16:34:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:34:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:34:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:34:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:34:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:34:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:34:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:34:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:34:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:34:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:34:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 16:34:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-08 16:34:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:34:16,221 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:34:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:34:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:34:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:34:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:34:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:34:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:34:16,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:34:16,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:34:16,324 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:34:16,326 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:34:16,625 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~mem45#1;havoc property_#t~ite63#1;havoc property_#t~mem47#1;havoc property_#t~mem46#1;havoc property_#t~mem48#1;havoc property_#t~mem49#1;havoc property_#t~ite52#1;havoc property_#t~mem50#1;havoc property_#t~mem51#1;havoc property_#t~mem53#1;havoc property_#t~ite62#1;havoc property_#t~mem54#1;havoc property_#t~ite59#1;havoc property_#t~mem56#1;havoc property_#t~mem55#1;havoc property_#t~mem58#1;havoc property_#t~mem57#1;havoc property_#t~mem61#1;havoc property_#t~mem60#1;havoc property_#t~mem64#1;havoc property_#t~bitwise65#1;havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~short72#1;havoc property_#t~mem73#1;havoc property_#t~short74#1;havoc property_#t~mem76#1;havoc property_#t~mem75#1;havoc property_#t~short77#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem78#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem82#1;havoc property_#t~short84#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1; [2025-03-08 16:34:16,660 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-03-08 16:34:16,660 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:34:16,674 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:34:16,674 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:34:16,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:16 BoogieIcfgContainer [2025-03-08 16:34:16,675 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:34:16,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:34:16,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:34:16,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:34:16,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:34:15" (1/3) ... [2025-03-08 16:34:16,681 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1f3f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:34:16, skipping insertion in model container [2025-03-08 16:34:16,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:16" (2/3) ... [2025-03-08 16:34:16,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1f3f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:34:16, skipping insertion in model container [2025-03-08 16:34:16,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:16" (3/3) ... [2025-03-08 16:34:16,683 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-9.i [2025-03-08 16:34:16,694 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:34:16,695 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-9.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:34:16,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:34:16,742 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;@41dc4127, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:34:16,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:34:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 16:34:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 16:34:16,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:16,754 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:16,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:16,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1849599051, now seen corresponding path program 1 times [2025-03-08 16:34:16,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:16,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965254488] [2025-03-08 16:34:16,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:16,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:16,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 16:34:16,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 16:34:16,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:16,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 16:34:16,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:16,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965254488] [2025-03-08 16:34:17,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965254488] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:17,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84146779] [2025-03-08 16:34:17,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:17,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:17,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:34:17,003 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-08 16:34:17,016 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-08 16:34:17,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 16:34:17,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 16:34:17,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:17,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:17,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:34:17,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 16:34:17,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:17,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84146779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:17,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:34:17,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:34:17,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299859718] [2025-03-08 16:34:17,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:17,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:34:17,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:17,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:34:17,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:34:17,220 INFO L87 Difference]: Start difference. First operand has 75 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 16:34:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:17,237 INFO L93 Difference]: Finished difference Result 144 states and 210 transitions. [2025-03-08 16:34:17,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:34:17,239 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-03-08 16:34:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:17,243 INFO L225 Difference]: With dead ends: 144 [2025-03-08 16:34:17,243 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 16:34:17,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 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-08 16:34:17,247 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:17,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 16:34:17,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-08 16:34:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 16:34:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2025-03-08 16:34:17,272 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 62 [2025-03-08 16:34:17,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:17,273 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2025-03-08 16:34:17,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 16:34:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2025-03-08 16:34:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 16:34:17,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:17,275 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:17,282 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-08 16:34:17,475 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-08 16:34:17,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:17,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:17,477 INFO L85 PathProgramCache]: Analyzing trace with hash 472600554, now seen corresponding path program 1 times [2025-03-08 16:34:17,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:17,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196357940] [2025-03-08 16:34:17,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:17,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:17,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 16:34:17,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 16:34:17,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:17,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 16:34:17,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:17,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196357940] [2025-03-08 16:34:17,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196357940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:17,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:17,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:34:17,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447470130] [2025-03-08 16:34:17,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:17,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:34:17,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:17,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:34:17,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:34:17,709 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:17,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:17,752 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2025-03-08 16:34:17,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:34:17,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-03-08 16:34:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:17,754 INFO L225 Difference]: With dead ends: 144 [2025-03-08 16:34:17,754 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 16:34:17,754 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-08 16:34:17,755 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:17,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 16:34:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-03-08 16:34:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 16:34:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2025-03-08 16:34:17,760 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 62 [2025-03-08 16:34:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:17,764 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2025-03-08 16:34:17,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2025-03-08 16:34:17,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 16:34:17,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:17,765 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:17,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:34:17,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:17,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:17,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1324350805, now seen corresponding path program 1 times [2025-03-08 16:34:17,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:17,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324702764] [2025-03-08 16:34:17,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:17,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:17,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 16:34:17,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 16:34:17,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:17,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 16:34:18,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:18,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324702764] [2025-03-08 16:34:18,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324702764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:18,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886893463] [2025-03-08 16:34:18,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:18,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:18,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:34:18,147 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-08 16:34:18,149 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-08 16:34:18,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 16:34:18,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 16:34:18,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:18,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:18,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:34:18,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 16:34:18,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:18,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886893463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:18,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:34:18,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-08 16:34:18,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663758830] [2025-03-08 16:34:18,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:18,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:34:18,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:18,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:34:18,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:34:18,331 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:18,365 INFO L93 Difference]: Finished difference Result 148 states and 205 transitions. [2025-03-08 16:34:18,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:34:18,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-03-08 16:34:18,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:18,367 INFO L225 Difference]: With dead ends: 148 [2025-03-08 16:34:18,367 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 16:34:18,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:34:18,368 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:18,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 275 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:18,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 16:34:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2025-03-08 16:34:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 16:34:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2025-03-08 16:34:18,377 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 62 [2025-03-08 16:34:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:18,377 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2025-03-08 16:34:18,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2025-03-08 16:34:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 16:34:18,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:18,378 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:18,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 16:34:18,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 16:34:18,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:18,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1163162028, now seen corresponding path program 1 times [2025-03-08 16:34:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:18,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137540360] [2025-03-08 16:34:18,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:18,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 16:34:18,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 16:34:18,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:18,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 16:34:18,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:18,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137540360] [2025-03-08 16:34:18,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137540360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:18,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976301178] [2025-03-08 16:34:18,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:18,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:18,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:34:18,844 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-08 16:34:18,845 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-08 16:34:18,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 16:34:18,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 16:34:18,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:18,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:18,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:34:18,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 16:34:19,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:19,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976301178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:19,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:34:19,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-08 16:34:19,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193810658] [2025-03-08 16:34:19,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:19,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:34:19,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:19,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:34:19,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:34:19,009 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:19,029 INFO L93 Difference]: Finished difference Result 152 states and 209 transitions. [2025-03-08 16:34:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:34:19,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-03-08 16:34:19,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:19,031 INFO L225 Difference]: With dead ends: 152 [2025-03-08 16:34:19,031 INFO L226 Difference]: Without dead ends: 79 [2025-03-08 16:34:19,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:34:19,031 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:19,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 276 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:19,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-08 16:34:19,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-03-08 16:34:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 16:34:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 106 transitions. [2025-03-08 16:34:19,040 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 106 transitions. Word has length 62 [2025-03-08 16:34:19,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:19,041 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 106 transitions. [2025-03-08 16:34:19,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2025-03-08 16:34:19,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 16:34:19,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:19,042 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:19,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 16:34:19,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:19,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:19,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:19,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1164085549, now seen corresponding path program 1 times [2025-03-08 16:34:19,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:19,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926033324] [2025-03-08 16:34:19,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:19,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:19,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 16:34:19,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 16:34:19,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:19,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 16:34:19,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926033324] [2025-03-08 16:34:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926033324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806878946] [2025-03-08 16:34:19,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:19,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:19,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:34:19,527 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-08 16:34:19,529 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-08 16:34:19,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 16:34:19,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 16:34:19,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:19,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:19,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:34:19,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:20,063 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-08 16:34:20,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 26 [2025-03-08 16:34:20,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 16:34:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 16:34:20,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:20,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806878946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:20,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:34:20,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2025-03-08 16:34:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893436982] [2025-03-08 16:34:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:20,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:34:20,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:20,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:34:20,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:34:20,122 INFO L87 Difference]: Start difference. First operand 78 states and 106 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:23,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 16:34:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:23,365 INFO L93 Difference]: Finished difference Result 228 states and 312 transitions. [2025-03-08 16:34:23,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:34:23,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-03-08 16:34:23,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:23,366 INFO L225 Difference]: With dead ends: 228 [2025-03-08 16:34:23,366 INFO L226 Difference]: Without dead ends: 153 [2025-03-08 16:34:23,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:34:23,367 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 239 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:23,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 510 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-08 16:34:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-08 16:34:23,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2025-03-08 16:34:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 16:34:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 204 transitions. [2025-03-08 16:34:23,393 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 204 transitions. Word has length 62 [2025-03-08 16:34:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:23,394 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 204 transitions. [2025-03-08 16:34:23,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 204 transitions. [2025-03-08 16:34:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 16:34:23,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:23,395 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:23,402 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-08 16:34:23,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:23,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:23,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:23,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1308388378, now seen corresponding path program 1 times [2025-03-08 16:34:23,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:23,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624275693] [2025-03-08 16:34:23,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:23,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:23,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 16:34:23,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 16:34:23,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:23,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 16:34:23,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:23,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624275693] [2025-03-08 16:34:23,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624275693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:23,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:23,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:34:23,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275868421] [2025-03-08 16:34:23,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:23,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:34:23,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:23,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:34:23,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:34:23,985 INFO L87 Difference]: Start difference. First operand 149 states and 204 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:24,132 INFO L93 Difference]: Finished difference Result 320 states and 436 transitions. [2025-03-08 16:34:24,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:34:24,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2025-03-08 16:34:24,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:24,134 INFO L225 Difference]: With dead ends: 320 [2025-03-08 16:34:24,134 INFO L226 Difference]: Without dead ends: 174 [2025-03-08 16:34:24,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:34:24,135 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 138 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:24,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 324 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:34:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-08 16:34:24,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2025-03-08 16:34:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 155 states have (on average 1.3290322580645162) internal successors, (206), 156 states have internal predecessors, (206), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 16:34:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 232 transitions. [2025-03-08 16:34:24,155 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 232 transitions. Word has length 63 [2025-03-08 16:34:24,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:24,155 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 232 transitions. [2025-03-08 16:34:24,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:24,158 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 232 transitions. [2025-03-08 16:34:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 16:34:24,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:24,159 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:24,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:34:24,159 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:24,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:24,160 INFO L85 PathProgramCache]: Analyzing trace with hash -211127830, now seen corresponding path program 1 times [2025-03-08 16:34:24,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:24,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107967983] [2025-03-08 16:34:24,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:24,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:24,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 16:34:24,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 16:34:24,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:24,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 16:34:24,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:24,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107967983] [2025-03-08 16:34:24,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107967983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:24,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:24,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:34:24,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612083904] [2025-03-08 16:34:24,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:24,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:34:24,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:24,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:34:24,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:34:24,258 INFO L87 Difference]: Start difference. First operand 173 states and 232 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:24,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:24,350 INFO L93 Difference]: Finished difference Result 447 states and 593 transitions. [2025-03-08 16:34:24,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:34:24,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2025-03-08 16:34:24,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:24,355 INFO L225 Difference]: With dead ends: 447 [2025-03-08 16:34:24,355 INFO L226 Difference]: Without dead ends: 289 [2025-03-08 16:34:24,356 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-08 16:34:24,357 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 69 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:24,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 321 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:34:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-08 16:34:24,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 228. [2025-03-08 16:34:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3103448275862069) internal successors, (266), 205 states have internal predecessors, (266), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:34:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 302 transitions. [2025-03-08 16:34:24,386 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 302 transitions. Word has length 67 [2025-03-08 16:34:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:24,386 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 302 transitions. [2025-03-08 16:34:24,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 302 transitions. [2025-03-08 16:34:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 16:34:24,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:24,387 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:24,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:34:24,387 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:24,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:24,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1051750975, now seen corresponding path program 1 times [2025-03-08 16:34:24,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:24,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953971233] [2025-03-08 16:34:24,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:24,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:24,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 16:34:24,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 16:34:24,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:24,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 16:34:24,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:34:24,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953971233] [2025-03-08 16:34:24,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953971233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:24,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093442839] [2025-03-08 16:34:24,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:24,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:24,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:34:24,699 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:34:24,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 16:34:24,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 16:34:24,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 16:34:24,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:24,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:24,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 16:34:24,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:25,562 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-03-08 16:34:25,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 22 [2025-03-08 16:34:25,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:34:25,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 16:34:25,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 16:34:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 16:34:25,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:25,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093442839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:25,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:34:25,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2025-03-08 16:34:25,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764827789] [2025-03-08 16:34:25,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:25,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:34:25,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:34:25,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:34:25,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:34:25,730 INFO L87 Difference]: Start difference. First operand 228 states and 302 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:25,977 INFO L93 Difference]: Finished difference Result 524 states and 693 transitions. [2025-03-08 16:34:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:34:25,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2025-03-08 16:34:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:25,979 INFO L225 Difference]: With dead ends: 524 [2025-03-08 16:34:25,979 INFO L226 Difference]: Without dead ends: 311 [2025-03-08 16:34:25,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:34:25,980 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 311 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:25,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 403 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:34:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-08 16:34:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 307. [2025-03-08 16:34:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 275 states have (on average 1.3054545454545454) internal successors, (359), 277 states have internal predecessors, (359), 23 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 16:34:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 405 transitions. [2025-03-08 16:34:26,007 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 405 transitions. Word has length 67 [2025-03-08 16:34:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:26,007 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 405 transitions. [2025-03-08 16:34:26,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 405 transitions. [2025-03-08 16:34:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 16:34:26,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:26,009 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:26,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 16:34:26,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:26,210 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:26,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:26,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1396727069, now seen corresponding path program 1 times [2025-03-08 16:34:26,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:34:26,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255101405] [2025-03-08 16:34:26,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:26,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:34:26,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 16:34:26,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 16:34:26,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:26,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:34:26,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451458838] [2025-03-08 16:34:26,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:26,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:26,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:34:26,275 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:34:26,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 16:34:26,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 16:34:26,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 16:34:26,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:26,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:34:26,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:34:26,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 16:34:26,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 16:34:26,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:26,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:34:26,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:34:26,604 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:34:26,605 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:34:26,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 16:34:26,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:34:26,812 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:34:26,885 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:34:26,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:34:26 BoogieIcfgContainer [2025-03-08 16:34:26,888 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:34:26,888 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:34:26,888 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:34:26,888 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:34:26,889 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:16" (3/4) ... [2025-03-08 16:34:26,890 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:34:26,891 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:34:26,892 INFO L158 Benchmark]: Toolchain (without parser) took 11029.82ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 113.4MB in the beginning and 259.5MB in the end (delta: -146.1MB). Peak memory consumption was 117.7MB. Max. memory is 16.1GB. [2025-03-08 16:34:26,892 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:34:26,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.18ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.1MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:34:26,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.80ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 96.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:34:26,892 INFO L158 Benchmark]: Boogie Preprocessor took 51.13ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:34:26,893 INFO L158 Benchmark]: IcfgBuilder took 504.11ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 64.4MB in the end (delta: 28.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:34:26,894 INFO L158 Benchmark]: TraceAbstraction took 10211.06ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 63.9MB in the beginning and 259.5MB in the end (delta: -195.6MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. [2025-03-08 16:34:26,894 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 411.0MB. Free memory was 259.5MB in the beginning and 259.5MB in the end (delta: 39.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:34:26,895 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.99ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.18ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.1MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.80ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 96.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.13ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 93.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 504.11ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 64.4MB in the end (delta: 28.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10211.06ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 63.9MB in the beginning and 259.5MB in the end (delta: -195.6MB). Peak memory consumption was 67.4MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 411.0MB. Free memory was 259.5MB in the beginning and 259.5MB in the end (delta: 39.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 96, overapproximation of shiftLeft at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] double double_Array_0[2] = { 9.2, 0.975 }; [L26-L28] double double_Array_0[2] = { 9.2, 0.975 }; [L26-L28] double double_Array_0[2] = { 9.2, 0.975 }; [L29] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L30] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L31-L33] signed long int signed_long_int_Array_0[1] = { -16 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -16 }; [L34] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L35-L37] signed short int signed_short_int_Array_0[2] = { 1, 100 }; [L35-L37] signed short int signed_short_int_Array_0[2] = { 1, 100 }; [L35-L37] signed short int signed_short_int_Array_0[2] = { 1, 100 }; [L38] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L39] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L40-L42] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L40-L42] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L40-L42] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L40-L42] unsigned char unsigned_char_Array_0[3] = { 32, 4, 10 }; [L43] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L44] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L45] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[2]); [L46] double last_1_double_Array_0_0_ = 9.2; [L47] signed long int last_1_signed_long_int_Array_0_0_ = -16; [L48] signed short int last_1_signed_short_int_Array_0_0_ = 1; [L49] unsigned char last_1_unsigned_char_Array_0_2_ = 10; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=0, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L90] EXPR double_Array_0[0] [L90] last_1_double_Array_0_0_ = double_Array_0[0] [L91] EXPR signed_long_int_Array_0[0] [L91] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L92] EXPR signed_short_int_Array_0[0] [L92] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L93] EXPR unsigned_char_Array_0[2] [L93] last_1_unsigned_char_Array_0_2_ = unsigned_char_Array_0[2] [L103] RET updateLastVariables() [L104] CALL updateVariables() [L80] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L81] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L81] 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}, \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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [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}, \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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L81] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L82] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L82] 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}, \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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [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}, \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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L82] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L83] double_Array_0[1] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[1] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L84] EXPR double_Array_0[1] [L84] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L84] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L84] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L84] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+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}, \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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [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}, \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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L84] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L85] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L86] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [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}, \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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L87] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [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}, \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}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L104] RET updateVariables() [L105] CALL step() [L53] unsigned char stepLocal_0 = last_1_double_Array_0_0_ > last_1_double_Array_0_0_; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, stepLocal_0=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}] [L54] COND FALSE !(((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || stepLocal_0) [L57] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) = last_1_signed_short_int_Array_0_0_ VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L59] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L59] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) = (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) [L60] EXPR \read(*signed_short_int_Array_0_arraysigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L60] EXPR 10 << (*(signed_short_int_Array_0_arraysigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L60] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L60] EXPR \read(*signed_long_int_Array_0_arraysigned_long_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L60] COND TRUE (10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) [L61] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L61] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L61] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) = ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))) [L63] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) = 64 [L64] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L64] (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) [L65] EXPR \read(*signed_short_int_Array_0_arraysigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L65] COND TRUE (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16 [L66] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L66] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR \read(*signed_short_int_Array_0_arraysigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) [L96] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L96] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L96] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1) [L96] EXPR \read(*signed_short_int_Array_0_arraysigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96] EXPR 10 << (*(signed_short_int_Array_0_arraysigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L96] EXPR \read(*signed_long_int_Array_0_arraysigned_long_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96] EXPR ((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1 [L96] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L96] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) [L96] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L96] EXPR ((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96] EXPR (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96] EXPR ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96] EXPR ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64)) [L96] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L96] EXPR ((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96] EXPR (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96] EXPR (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) [L96] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L96] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L96] EXPR (((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96] EXPR ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) last_1_signed_short_int_Array_0_0_))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96] EXPR ((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) last_1_signed_short_int_Array_0_0_))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96] EXPR (((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96] EXPR (((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L96-L97] return (((((((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) <= 16) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : (((((((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) > ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) : ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))))) < (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) && (((10 << (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer))) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) * (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)))) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer))))) : 1)) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) 64))) && ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer))))) && ((((last_1_signed_short_int_Array_0_0_ + last_1_unsigned_char_Array_0_2_) < 10) || (last_1_double_Array_0_0_ > last_1_double_Array_0_0_)) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) (((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) > (last_1_unsigned_char_Array_0_2_)) ? ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + last_1_signed_short_int_Array_0_0_) - ((((last_1_signed_long_int_Array_0_0_) > (last_1_signed_short_int_Array_0_0_)) ? (last_1_signed_long_int_Array_0_0_) : (last_1_signed_short_int_Array_0_0_))))) : (last_1_unsigned_char_Array_0_2_))))) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) == ((signed short int) last_1_signed_short_int_Array_0_0_)))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)))) ; [L106] RET, EXPR property() [L106] 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}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_double_Array_0_0_=46/5, last_1_signed_long_int_Array_0_0_=-16, last_1_signed_short_int_Array_0_0_=1, last_1_unsigned_char_Array_0_2_=10, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7: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}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 110 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 760 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 760 mSDsluCounter, 2481 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1695 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 420 IncrementalHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 786 mSDtfsCounter, 420 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 373 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=8, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 73 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 958 NumberOfCodeBlocks, 958 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 809 ConstructedInterpolants, 72 QuantifiedInterpolants, 3547 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1651 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 464/520 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-08 16:34:26,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-9.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 6505c5086d29586e7ec0f5f77e8e039fa1bd40cb84198ddba96d37f8ed5ec1eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:34:28,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:34:28,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:34:28,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:34:28,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:34:28,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:34:28,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:34:28,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:34:28,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:34:28,913 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:34:28,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:34:28,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:34:28,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:34:28,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:34:28,914 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:34:28,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:34:28,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:34:28,914 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:34:28,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:34:28,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:34:28,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:34:28,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:34:28,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:34:28,915 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:34:28,915 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:34:28,915 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:34:28,915 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:34:28,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:34:28,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:34:28,915 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:34:28,916 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:34:28,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:34:28,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:34:28,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:34:28,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:34:28,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:34:28,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:34:28,916 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:34:28,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:34:28,916 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:34:28,917 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:34:28,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:34:28,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:34:28,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:34:28,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:34:28,917 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 -> 6505c5086d29586e7ec0f5f77e8e039fa1bd40cb84198ddba96d37f8ed5ec1eb [2025-03-08 16:34:29,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:34:29,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:34:29,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:34:29,164 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:34:29,164 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:34:29,167 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-9.i [2025-03-08 16:34:30,357 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8b58e2d5/6e20eeee909a4fe6888f84356121b186/FLAG23bd1a560 [2025-03-08 16:34:30,556 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:34:30,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-9.i [2025-03-08 16:34:30,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8b58e2d5/6e20eeee909a4fe6888f84356121b186/FLAG23bd1a560 [2025-03-08 16:34:30,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8b58e2d5/6e20eeee909a4fe6888f84356121b186 [2025-03-08 16:34:30,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:34:30,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:34:30,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:34:30,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:34:30,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:34:30,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:34:30" (1/1) ... [2025-03-08 16:34:30,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4637b992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:30, skipping insertion in model container [2025-03-08 16:34:30,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:34:30" (1/1) ... [2025-03-08 16:34:30,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:34:30,721 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-9.i[916,929] [2025-03-08 16:34:30,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:34:30,797 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:34:30,808 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-9.i[916,929] [2025-03-08 16:34:30,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:34:30,855 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:34:30,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:30 WrapperNode [2025-03-08 16:34:30,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:34:30,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:34:30,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:34:30,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:34:30,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:30" (1/1) ... [2025-03-08 16:34:30,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:30" (1/1) ... [2025-03-08 16:34:30,906 INFO L138 Inliner]: procedures = 36, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 342 [2025-03-08 16:34:30,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:34:30,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:34:30,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:34:30,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:34:30,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:30" (1/1) ... [2025-03-08 16:34:30,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:30" (1/1) ... [2025-03-08 16:34:30,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:30" (1/1) ... [2025-03-08 16:34:30,947 INFO L175 MemorySlicer]: Split 86 memory accesses to 6 slices as follows [2, 6, 22, 8, 17, 31]. 36 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 2, 1, 2, 3]. The 13 writes are split as follows [0, 1, 2, 1, 3, 6]. [2025-03-08 16:34:30,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:30" (1/1) ... [2025-03-08 16:34:30,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:30" (1/1) ... [2025-03-08 16:34:30,959 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:30" (1/1) ... [2025-03-08 16:34:30,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:30" (1/1) ... [2025-03-08 16:34:30,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:30" (1/1) ... [2025-03-08 16:34:30,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:30" (1/1) ... [2025-03-08 16:34:30,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:34:30,980 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:34:30,980 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:34:30,980 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:34:30,981 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:30" (1/1) ... [2025-03-08 16:34:30,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:34:30,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:34:31,010 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-08 16:34:31,016 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-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-08 16:34:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-08 16:34:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 16:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-08 16:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-08 16:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-08 16:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 16:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 16:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-08 16:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-08 16:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-08 16:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-08 16:34:31,038 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:34:31,038 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:34:31,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-08 16:34:31,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-08 16:34:31,154 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:34:31,155 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:34:31,638 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~mem44#1;havoc property_#t~ite62#1;havoc property_#t~mem46#1;havoc property_#t~mem45#1;havoc property_#t~mem47#1;havoc property_#t~mem48#1;havoc property_#t~ite51#1;havoc property_#t~mem49#1;havoc property_#t~mem50#1;havoc property_#t~mem52#1;havoc property_#t~ite61#1;havoc property_#t~mem53#1;havoc property_#t~ite58#1;havoc property_#t~mem55#1;havoc property_#t~mem54#1;havoc property_#t~mem57#1;havoc property_#t~mem56#1;havoc property_#t~mem60#1;havoc property_#t~mem59#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite69#1;havoc property_#t~mem68#1;havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~short70#1;havoc property_#t~mem71#1;havoc property_#t~short72#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~short75#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem76#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem80#1;havoc property_#t~short82#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~short85#1; [2025-03-08 16:34:31,667 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-03-08 16:34:31,667 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:34:31,678 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:34:31,678 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:34:31,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:31 BoogieIcfgContainer [2025-03-08 16:34:31,678 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:34:31,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:34:31,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:34:31,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:34:31,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:34:30" (1/3) ... [2025-03-08 16:34:31,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bb8f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:34:31, skipping insertion in model container [2025-03-08 16:34:31,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:30" (2/3) ... [2025-03-08 16:34:31,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bb8f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:34:31, skipping insertion in model container [2025-03-08 16:34:31,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:31" (3/3) ... [2025-03-08 16:34:31,688 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-9.i [2025-03-08 16:34:31,698 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:34:31,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-9.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:34:31,737 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:34:31,744 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;@26cde5dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:34:31,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:34:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 16:34:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 16:34:31,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:31,753 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:31,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:31,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:31,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2010662330, now seen corresponding path program 1 times [2025-03-08 16:34:31,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:34:31,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146994848] [2025-03-08 16:34:31,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:31,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:34:31,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:34:31,774 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-08 16:34:31,776 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-08 16:34:31,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 16:34:32,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 16:34:32,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:32,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:32,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:34:32,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 16:34:32,053 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:32,054 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:34:32,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146994848] [2025-03-08 16:34:32,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146994848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:32,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:32,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:34:32,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6509329] [2025-03-08 16:34:32,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:32,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:34:32,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:34:32,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:34:32,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:34:32,076 INFO L87 Difference]: Start difference. First operand has 69 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:32,090 INFO L93 Difference]: Finished difference Result 132 states and 194 transitions. [2025-03-08 16:34:32,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:34:32,091 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-03-08 16:34:32,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:32,098 INFO L225 Difference]: With dead ends: 132 [2025-03-08 16:34:32,098 INFO L226 Difference]: Without dead ends: 66 [2025-03-08 16:34:32,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-08 16:34:32,101 INFO L435 NwaCegarLoop]: 92 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, 92 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-08 16:34:32,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:32,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-08 16:34:32,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-08 16:34:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 16:34:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2025-03-08 16:34:32,128 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 60 [2025-03-08 16:34:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:32,129 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2025-03-08 16:34:32,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2025-03-08 16:34:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 16:34:32,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:32,131 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:32,139 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-08 16:34:32,336 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-08 16:34:32,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:32,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:32,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1709788441, now seen corresponding path program 1 times [2025-03-08 16:34:32,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:34:32,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963384846] [2025-03-08 16:34:32,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:32,337 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-08 16:34:32,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:34:32,339 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-08 16:34:32,340 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-08 16:34:32,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 16:34:32,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 16:34:32,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:32,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:32,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:34:32,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 16:34:32,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:32,619 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:34:32,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963384846] [2025-03-08 16:34:32,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963384846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:32,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:32,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:34:32,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878694960] [2025-03-08 16:34:32,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:32,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:34:32,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:34:32,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:34:32,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:34:32,623 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:32,657 INFO L93 Difference]: Finished difference Result 132 states and 185 transitions. [2025-03-08 16:34:32,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:34:32,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-03-08 16:34:32,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:32,660 INFO L225 Difference]: With dead ends: 132 [2025-03-08 16:34:32,660 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 16:34:32,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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-08 16:34:32,661 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:32,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 256 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:32,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 16:34:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-03-08 16:34:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 16:34:32,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2025-03-08 16:34:32,670 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 60 [2025-03-08 16:34:32,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:32,671 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2025-03-08 16:34:32,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2025-03-08 16:34:32,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 16:34:32,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:32,672 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:32,679 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-08 16:34:32,873 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-08 16:34:32,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:32,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:32,875 INFO L85 PathProgramCache]: Analyzing trace with hash -87162918, now seen corresponding path program 1 times [2025-03-08 16:34:32,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:34:32,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749147015] [2025-03-08 16:34:32,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:32,876 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-08 16:34:32,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:34:32,880 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-08 16:34:32,881 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-08 16:34:32,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 16:34:33,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 16:34:33,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:33,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:33,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:34:33,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 16:34:33,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:33,116 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:34:33,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749147015] [2025-03-08 16:34:33,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749147015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:33,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:33,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:34:33,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936392387] [2025-03-08 16:34:33,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:33,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:34:33,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:34:33,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:34:33,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:34:33,117 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:33,166 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2025-03-08 16:34:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:34:33,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-03-08 16:34:33,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:33,168 INFO L225 Difference]: With dead ends: 136 [2025-03-08 16:34:33,168 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 16:34:33,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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-08 16:34:33,169 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 333 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:33,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 333 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:33,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 16:34:33,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-03-08 16:34:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 16:34:33,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2025-03-08 16:34:33,177 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 60 [2025-03-08 16:34:33,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:33,177 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2025-03-08 16:34:33,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2025-03-08 16:34:33,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 16:34:33,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:33,179 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:33,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 16:34:33,380 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-08 16:34:33,380 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:33,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:33,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1894617381, now seen corresponding path program 1 times [2025-03-08 16:34:33,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:34:33,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835365430] [2025-03-08 16:34:33,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:33,381 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-08 16:34:33,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:34:33,384 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-08 16:34:33,385 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-08 16:34:33,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 16:34:33,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 16:34:33,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:33,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:33,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:34:33,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 16:34:33,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:33,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:34:33,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835365430] [2025-03-08 16:34:33,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835365430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:33,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:33,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:34:33,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976698102] [2025-03-08 16:34:33,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:33,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:34:33,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:34:33,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:34:33,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:34:33,614 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:33,666 INFO L93 Difference]: Finished difference Result 142 states and 196 transitions. [2025-03-08 16:34:33,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:34:33,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-03-08 16:34:33,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:33,669 INFO L225 Difference]: With dead ends: 142 [2025-03-08 16:34:33,669 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 16:34:33,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:34:33,670 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:33,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:34:33,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 16:34:33,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-03-08 16:34:33,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 16:34:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2025-03-08 16:34:33,677 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 60 [2025-03-08 16:34:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:33,677 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2025-03-08 16:34:33,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2025-03-08 16:34:33,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 16:34:33,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:33,679 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:33,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 16:34:33,880 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-08 16:34:33,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:33,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:33,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1893693860, now seen corresponding path program 1 times [2025-03-08 16:34:33,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:34:33,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965353396] [2025-03-08 16:34:33,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:33,881 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-08 16:34:33,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:34:33,883 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-08 16:34:33,884 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-08 16:34:33,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 16:34:34,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 16:34:34,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:34,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:34,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 16:34:34,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:35,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-08 16:34:35,493 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2025-03-08 16:34:35,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-08 16:34:35,575 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 16:34:35,576 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 36 treesize of output 20 [2025-03-08 16:34:35,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2025-03-08 16:34:35,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2025-03-08 16:34:35,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:34:35,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 54 [2025-03-08 16:34:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 16:34:35,921 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:34:36,011 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 16:34:36,011 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:34:36,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965353396] [2025-03-08 16:34:36,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965353396] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:34:36,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:34:36,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2025-03-08 16:34:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195268193] [2025-03-08 16:34:36,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:36,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:34:36,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:34:36,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:34:36,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:34:36,012 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:36,160 INFO L93 Difference]: Finished difference Result 164 states and 222 transitions. [2025-03-08 16:34:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:34:36,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-03-08 16:34:36,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:36,162 INFO L225 Difference]: With dead ends: 164 [2025-03-08 16:34:36,162 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 16:34:36,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:34:36,163 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 64 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:36,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 337 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:34:36,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 16:34:36,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2025-03-08 16:34:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 82 states have internal predecessors, (107), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 16:34:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2025-03-08 16:34:36,174 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 60 [2025-03-08 16:34:36,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:36,174 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2025-03-08 16:34:36,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2025-03-08 16:34:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 16:34:36,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:36,175 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:36,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-08 16:34:36,375 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-08 16:34:36,376 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:36,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:36,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1588336472, now seen corresponding path program 1 times [2025-03-08 16:34:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:34:36,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774684086] [2025-03-08 16:34:36,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:36,377 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-08 16:34:36,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:34:36,382 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-08 16:34:36,384 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-08 16:34:36,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 16:34:36,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 16:34:36,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:36,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:36,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 16:34:36,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:37,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-03-08 16:34:37,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 16:34:37,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2025-03-08 16:34:37,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:34:37,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 43 [2025-03-08 16:34:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 16:34:37,496 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:34:37,496 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:34:37,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774684086] [2025-03-08 16:34:37,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774684086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:34:37,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:34:37,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:34:37,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711554839] [2025-03-08 16:34:37,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:34:37,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:34:37,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:34:37,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:34:37,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:34:37,497 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:37,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:34:37,981 INFO L93 Difference]: Finished difference Result 263 states and 348 transitions. [2025-03-08 16:34:37,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:34:37,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-03-08 16:34:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:34:37,983 INFO L225 Difference]: With dead ends: 263 [2025-03-08 16:34:37,983 INFO L226 Difference]: Without dead ends: 186 [2025-03-08 16:34:37,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:34:37,984 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 279 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:34:37,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 483 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:34:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-08 16:34:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 174. [2025-03-08 16:34:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 153 states have (on average 1.3137254901960784) internal successors, (201), 154 states have internal predecessors, (201), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:34:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 231 transitions. [2025-03-08 16:34:38,007 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 231 transitions. Word has length 62 [2025-03-08 16:34:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:34:38,007 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 231 transitions. [2025-03-08 16:34:38,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 16:34:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 231 transitions. [2025-03-08 16:34:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 16:34:38,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:34:38,009 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:34:38,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-08 16:34:38,211 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-08 16:34:38,212 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:34:38,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:34:38,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2016069350, now seen corresponding path program 1 times [2025-03-08 16:34:38,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:34:38,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959887228] [2025-03-08 16:34:38,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:34:38,213 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-08 16:34:38,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:34:38,214 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-08 16:34:38,215 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-08 16:34:38,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 16:34:38,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 16:34:38,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:34:38,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:34:38,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 16:34:38,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:34:39,383 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2025-03-08 16:34:39,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-08 16:34:39,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 16:34:39,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-03-08 16:34:39,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-03-08 16:34:40,006 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 45 treesize of output 33 [2025-03-08 16:34:40,014 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 16:34:40,014 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 59 treesize of output 35 [2025-03-08 16:34:40,018 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 28 treesize of output 20 [2025-03-08 16:34:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 16:34:40,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:35:02,955 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:35:02,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959887228] [2025-03-08 16:35:02,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [959887228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:35:02,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [496985408] [2025-03-08 16:35:02,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:35:02,955 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:35:02,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:35:02,987 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:35:02,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-08 16:35:03,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 16:35:03,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 16:35:03,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:35:03,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:35:03,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 16:35:03,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:35:08,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-08 16:35:10,992 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2025-03-08 16:35:10,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2025-03-08 16:35:11,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-08 16:35:13,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2025-03-08 16:35:13,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-08 16:35:15,013 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 42 treesize of output 30 [2025-03-08 16:35:15,039 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 16:35:15,039 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 56 treesize of output 32 [2025-03-08 16:35:15,074 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-08 16:35:15,330 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 16:35:15,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:35:28,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [496985408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:35:28,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:35:28,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-08 16:35:28,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991444366] [2025-03-08 16:35:28,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:35:28,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 16:35:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:35:28,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 16:35:28,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=529, Unknown=5, NotChecked=0, Total=650 [2025-03-08 16:35:28,659 INFO L87 Difference]: Start difference. First operand 174 states and 231 transitions. Second operand has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 18 states have internal predecessors, (72), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 16:35:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:35:35,773 INFO L93 Difference]: Finished difference Result 328 states and 435 transitions. [2025-03-08 16:35:35,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:35:35,774 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 18 states have internal predecessors, (72), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 62 [2025-03-08 16:35:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:35:35,776 INFO L225 Difference]: With dead ends: 328 [2025-03-08 16:35:35,776 INFO L226 Difference]: Without dead ends: 177 [2025-03-08 16:35:35,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 40.9s TimeCoverageRelationStatistics Valid=193, Invalid=672, Unknown=5, NotChecked=0, Total=870 [2025-03-08 16:35:35,777 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 527 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:35:35,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 770 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-08 16:35:35,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-08 16:35:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2025-03-08 16:35:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 152 states have (on average 1.3092105263157894) internal successors, (199), 153 states have internal predecessors, (199), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 16:35:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 229 transitions. [2025-03-08 16:35:35,797 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 229 transitions. Word has length 62 [2025-03-08 16:35:35,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:35:35,798 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 229 transitions. [2025-03-08 16:35:35,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 18 states have internal predecessors, (72), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-08 16:35:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 229 transitions. [2025-03-08 16:35:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 16:35:35,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:35:35,799 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:35,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-03-08 16:35:36,008 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 (8)] Forceful destruction successful, exit code 0 [2025-03-08 16:35:36,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-08 16:35:36,201 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:35:36,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:35:36,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1082777847, now seen corresponding path program 1 times [2025-03-08 16:35:36,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:35:36,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044192352] [2025-03-08 16:35:36,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:35:36,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-08 16:35:36,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:35:36,204 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-08 16:35:36,205 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-08 16:35:36,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 16:35:36,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 16:35:36,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:35:36,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:35:36,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 16:35:36,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:35:38,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-08 16:35:42,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 100 [2025-03-08 16:35:44,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:35:44,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 296 treesize of output 148 [2025-03-08 16:35:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 16:35:45,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:35:46,899 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:35:46,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044192352] [2025-03-08 16:35:46,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044192352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:35:46,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [405810313] [2025-03-08 16:35:46,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:35:46,899 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:35:46,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:35:46,901 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:35:46,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2025-03-08 16:35:47,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 16:35:47,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 16:35:47,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:35:47,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:35:47,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 16:35:47,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:35:50,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1