./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.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 9ed7d52db15c526d7f8d423512adcea77404e9fba9479175fb6f6fa9d9e8b07d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:50:39,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:50:39,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:50:39,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:50:39,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:50:39,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:50:39,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:50:39,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:50:39,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:50:39,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:50:39,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:50:39,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:50:39,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:50:39,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:50:39,881 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:50:39,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:50:39,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:50:39,881 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:50:39,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:50:39,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:50:39,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:50:39,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:50:39,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:50:39,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:50:39,882 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:50:39,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:50:39,882 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:50:39,882 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:50:39,882 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:50:39,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:50:39,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:50:39,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:50:39,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:50:39,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:50:39,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:50:39,883 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:50:39,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:50:39,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:50:39,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:50:39,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:50:39,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:50:39,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:50:39,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:50:39,884 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 -> 9ed7d52db15c526d7f8d423512adcea77404e9fba9479175fb6f6fa9d9e8b07d [2025-03-17 05:50:40,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:50:40,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:50:40,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:50:40,102 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:50:40,103 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:50:40,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i [2025-03-17 05:50:41,221 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/393ac00e7/4b57fc6a36e247fd8d1cfeac95e352d2/FLAGf6599fe74 [2025-03-17 05:50:41,441 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:50:41,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i [2025-03-17 05:50:41,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/393ac00e7/4b57fc6a36e247fd8d1cfeac95e352d2/FLAGf6599fe74 [2025-03-17 05:50:41,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/393ac00e7/4b57fc6a36e247fd8d1cfeac95e352d2 [2025-03-17 05:50:41,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:50:41,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:50:41,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:50:41,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:50:41,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:50:41,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:50:41" (1/1) ... [2025-03-17 05:50:41,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3efbafe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:41, skipping insertion in model container [2025-03-17 05:50:41,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:50:41" (1/1) ... [2025-03-17 05:50:41,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:50:41,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i[916,929] [2025-03-17 05:50:42,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:50:42,037 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:50:42,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i[916,929] [2025-03-17 05:50:42,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:50:42,084 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:50:42,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:42 WrapperNode [2025-03-17 05:50:42,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:50:42,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:50:42,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:50:42,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:50:42,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:42" (1/1) ... [2025-03-17 05:50:42,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:42" (1/1) ... [2025-03-17 05:50:42,130 INFO L138 Inliner]: procedures = 29, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 439 [2025-03-17 05:50:42,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:50:42,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:50:42,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:50:42,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:50:42,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:42" (1/1) ... [2025-03-17 05:50:42,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:42" (1/1) ... [2025-03-17 05:50:42,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:42" (1/1) ... [2025-03-17 05:50:42,157 INFO L175 MemorySlicer]: Split 110 memory accesses to 12 slices as follows [2, 9, 10, 6, 7, 18, 14, 5, 8, 8, 17, 6]. 16 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1]. [2025-03-17 05:50:42,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:42" (1/1) ... [2025-03-17 05:50:42,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:42" (1/1) ... [2025-03-17 05:50:42,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:42" (1/1) ... [2025-03-17 05:50:42,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:42" (1/1) ... [2025-03-17 05:50:42,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:42" (1/1) ... [2025-03-17 05:50:42,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:42" (1/1) ... [2025-03-17 05:50:42,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:50:42,184 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:50:42,184 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:50:42,184 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:50:42,185 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:42" (1/1) ... [2025-03-17 05:50:42,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:50:42,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:50:42,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:50:42,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:50:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:50:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:50:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:50:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:50:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:50:42,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:50:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:50:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:50:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:50:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:50:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:50:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:50:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:50:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:50:42,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:50:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:50:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:50:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:50:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:50:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:50:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-17 05:50:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-17 05:50:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-17 05:50:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-17 05:50:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-17 05:50:42,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:50:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:50:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:50:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:50:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:50:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:50:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:50:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-17 05:50:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-17 05:50:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-17 05:50:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-17 05:50:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-17 05:50:42,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:50:42,233 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:50:42,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:50:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:50:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:50:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:50:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:50:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:50:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:50:42,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:50:42,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:50:42,411 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:50:42,413 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:50:42,819 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~short74#1;havoc property_#t~ite86#1;havoc property_#t~mem77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~short78#1;havoc property_#t~ite85#1;havoc property_#t~mem81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem87#1;havoc property_#t~ite102#1;havoc property_#t~mem90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite101#1;havoc property_#t~mem98#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite111#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~short117#1; [2025-03-17 05:50:42,867 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-03-17 05:50:42,868 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:50:42,875 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:50:42,877 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:50:42,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:50:42 BoogieIcfgContainer [2025-03-17 05:50:42,878 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:50:42,880 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:50:42,880 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:50:42,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:50:42,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:50:41" (1/3) ... [2025-03-17 05:50:42,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1110b738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:50:42, skipping insertion in model container [2025-03-17 05:50:42,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:42" (2/3) ... [2025-03-17 05:50:42,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1110b738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:50:42, skipping insertion in model container [2025-03-17 05:50:42,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:50:42" (3/3) ... [2025-03-17 05:50:42,886 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-78.i [2025-03-17 05:50:42,897 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:50:42,899 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-78.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:50:42,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:50:42,952 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;@23810ee1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:50:42,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:50:42,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 05:50:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:50:42,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:42,964 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:42,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:42,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:42,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2006130283, now seen corresponding path program 1 times [2025-03-17 05:50:42,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:42,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475320166] [2025-03-17 05:50:42,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:42,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:43,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:50:43,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:50:43,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:43,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 05:50:43,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:43,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475320166] [2025-03-17 05:50:43,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475320166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:50:43,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717341342] [2025-03-17 05:50:43,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:43,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:50:43,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:50:43,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:50:43,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:50:43,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:50:43,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:50:43,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:43,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:43,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:50:43,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 05:50:43,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:50:43,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717341342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:43,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:50:43,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:50:43,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198765275] [2025-03-17 05:50:43,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:43,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:50:43,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:43,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:50:43,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:50:43,469 INFO L87 Difference]: Start difference. First operand has 87 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 05:50:43,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:43,488 INFO L93 Difference]: Finished difference Result 171 states and 266 transitions. [2025-03-17 05:50:43,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:50:43,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2025-03-17 05:50:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:43,493 INFO L225 Difference]: With dead ends: 171 [2025-03-17 05:50:43,493 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 05:50:43,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:50:43,497 INFO L435 NwaCegarLoop]: 125 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, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:43,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:50:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 05:50:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 05:50:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 05:50:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2025-03-17 05:50:43,525 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 94 [2025-03-17 05:50:43,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:43,525 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2025-03-17 05:50:43,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 05:50:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2025-03-17 05:50:43,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:50:43,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:43,530 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:43,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:50:43,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:50:43,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:43,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:43,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1408723291, now seen corresponding path program 1 times [2025-03-17 05:50:43,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:43,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579693888] [2025-03-17 05:50:43,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:43,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:43,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:50:43,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:50:43,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:43,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-17 05:50:44,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:44,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579693888] [2025-03-17 05:50:44,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579693888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:50:44,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726052422] [2025-03-17 05:50:44,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:44,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:50:44,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:50:44,068 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:50:44,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:50:44,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:50:44,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:50:44,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:44,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:44,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:50:44,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 05:50:44,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:50:44,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726052422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:44,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:50:44,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:50:44,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665845822] [2025-03-17 05:50:44,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:44,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:50:44,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:44,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:50:44,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:50:44,295 INFO L87 Difference]: Start difference. First operand 85 states and 125 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 05:50:44,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:44,330 INFO L93 Difference]: Finished difference Result 171 states and 252 transitions. [2025-03-17 05:50:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:50:44,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 94 [2025-03-17 05:50:44,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:44,332 INFO L225 Difference]: With dead ends: 171 [2025-03-17 05:50:44,332 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 05:50:44,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:50:44,333 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:44,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:50:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 05:50:44,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 05:50:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 75 states have internal predecessors, (107), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 05:50:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 127 transitions. [2025-03-17 05:50:44,341 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 127 transitions. Word has length 94 [2025-03-17 05:50:44,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:44,341 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 127 transitions. [2025-03-17 05:50:44,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 05:50:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 127 transitions. [2025-03-17 05:50:44,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:50:44,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:44,347 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:44,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:50:44,547 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,SelfDestructingSolverStorable1 [2025-03-17 05:50:44,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:44,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash -3071613, now seen corresponding path program 1 times [2025-03-17 05:50:44,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:44,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138811886] [2025-03-17 05:50:44,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:44,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:44,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:50:44,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:50:44,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:44,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 05:50:44,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:50:44,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138811886] [2025-03-17 05:50:44,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138811886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:44,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:44,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:50:44,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60335793] [2025-03-17 05:50:44,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:44,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:50:44,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:50:44,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:50:44,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:50:44,840 INFO L87 Difference]: Start difference. First operand 87 states and 127 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 05:50:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:44,904 INFO L93 Difference]: Finished difference Result 259 states and 379 transitions. [2025-03-17 05:50:44,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:50:44,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 96 [2025-03-17 05:50:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:44,908 INFO L225 Difference]: With dead ends: 259 [2025-03-17 05:50:44,908 INFO L226 Difference]: Without dead ends: 173 [2025-03-17 05:50:44,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:50:44,909 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 83 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:44,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 345 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:50:44,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-17 05:50:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2025-03-17 05:50:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 147 states have (on average 1.4217687074829932) internal successors, (209), 147 states have internal predecessors, (209), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:50:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 249 transitions. [2025-03-17 05:50:44,933 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 249 transitions. Word has length 96 [2025-03-17 05:50:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:44,933 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 249 transitions. [2025-03-17 05:50:44,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 05:50:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 249 transitions. [2025-03-17 05:50:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:50:44,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:44,934 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:44,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:50:44,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:44,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:44,935 INFO L85 PathProgramCache]: Analyzing trace with hash -513605790, now seen corresponding path program 1 times [2025-03-17 05:50:44,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:50:44,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15894026] [2025-03-17 05:50:44,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:44,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:50:44,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:50:45,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:50:45,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:45,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:50:45,001 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:50:45,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:50:45,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:50:45,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:45,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:50:45,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:50:45,112 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:50:45,113 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:50:45,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:50:45,116 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-17 05:50:45,255 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:50:45,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:50:45 BoogieIcfgContainer [2025-03-17 05:50:45,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:50:45,259 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:50:45,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:50:45,259 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:50:45,260 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:50:42" (3/4) ... [2025-03-17 05:50:45,261 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:50:45,262 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:50:45,263 INFO L158 Benchmark]: Toolchain (without parser) took 3478.03ms. Allocated memory is still 201.3MB. Free memory was 158.7MB in the beginning and 152.9MB in the end (delta: 5.8MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2025-03-17 05:50:45,263 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:50:45,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.45ms. Allocated memory is still 201.3MB. Free memory was 158.7MB in the beginning and 144.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:50:45,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.60ms. Allocated memory is still 201.3MB. Free memory was 144.9MB in the beginning and 142.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:50:45,264 INFO L158 Benchmark]: Boogie Preprocessor took 51.90ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 138.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:50:45,264 INFO L158 Benchmark]: IcfgBuilder took 694.20ms. Allocated memory is still 201.3MB. Free memory was 138.2MB in the beginning and 105.4MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:50:45,265 INFO L158 Benchmark]: TraceAbstraction took 2378.34ms. Allocated memory is still 201.3MB. Free memory was 105.0MB in the beginning and 154.7MB in the end (delta: -49.6MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2025-03-17 05:50:45,265 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 152.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:50:45,266 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.28ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.45ms. Allocated memory is still 201.3MB. Free memory was 158.7MB in the beginning and 144.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.60ms. Allocated memory is still 201.3MB. Free memory was 144.9MB in the beginning and 142.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.90ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 138.2MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 694.20ms. Allocated memory is still 201.3MB. Free memory was 138.2MB in the beginning and 105.4MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2378.34ms. Allocated memory is still 201.3MB. Free memory was 105.0MB in the beginning and 154.7MB in the end (delta: -49.6MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 152.9MB in the end (delta: 1.7MB). 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 someBinaryArithmeticDOUBLEoperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryArithmeticFLOAToperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -200; [L22] signed long int var_1_1 = -200; [L23] signed long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] unsigned char var_1_3 = 1; [L26] unsigned char var_1_3 = 1; [L27] unsigned char* var_1_3_Pointer = &(var_1_3); [L28] float var_1_9 = 100.55; [L28] float var_1_9 = 100.55; [L29] float* var_1_9_Pointer = &(var_1_9); [L30] float var_1_10 = 4.75; [L30] float var_1_10 = 4.75; [L31] float* var_1_10_Pointer = &(var_1_10); [L32] float var_1_11 = 128.75; [L32] float var_1_11 = 128.75; [L33] float* var_1_11_Pointer = &(var_1_11); [L34] double var_1_12 = 128.5; [L34] double var_1_12 = 128.5; [L35] double* var_1_12_Pointer = &(var_1_12); [L36] double var_1_13 = 0.0; [L36] double var_1_13 = 0.0; [L37] double* var_1_13_Pointer = &(var_1_13); [L38] double var_1_14 = 127.875; [L38] double var_1_14 = 127.875; [L39] double* var_1_14_Pointer = &(var_1_14); [L40] unsigned char var_1_15 = 1; [L40] unsigned char var_1_15 = 1; [L41] unsigned char* var_1_15_Pointer = &(var_1_15); [L42] unsigned char var_1_16 = 16; [L42] unsigned char var_1_16 = 16; [L43] unsigned char* var_1_16_Pointer = &(var_1_16); [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] FCALL updateLastVariables() [L105] CALL updateVariables() [L76] var_1_2 = __VERIFIER_nondet_uchar() [L77] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L77] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L77] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] EXPR \read(var_1_2) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L78] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L79] var_1_3 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L80] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] EXPR \read(var_1_3) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L81] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L82] var_1_10 = __VERIFIER_nondet_float() [L83] EXPR \read(var_1_10) [L83] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F [L83] EXPR \read(var_1_10) [L83] EXPR var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR (var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] EXPR (var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L83] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L84] var_1_11 = __VERIFIER_nondet_float() [L85] EXPR \read(var_1_11) [L85] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F [L85] EXPR \read(var_1_11) [L85] EXPR var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] EXPR (var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] EXPR (var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L85] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L86] var_1_13 = __VERIFIER_nondet_double() [L87] EXPR \read(var_1_13) [L87] EXPR var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] EXPR var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F [L87] EXPR \read(var_1_13) [L87] EXPR var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] EXPR (var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] EXPR (var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L87] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L88] var_1_14 = __VERIFIER_nondet_double() [L89] EXPR \read(var_1_14) [L89] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F [L89] EXPR \read(var_1_14) [L89] EXPR var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] EXPR (var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L89] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L90] var_1_16 = __VERIFIER_nondet_uchar() [L91] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L91] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L92] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L105] RET updateVariables() [L106] CALL step() [L47] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L47] COND TRUE 0.8f > (- (*(var_1_10_Pointer))) [L48] EXPR \read(*var_1_16_Pointer) [L48] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L50] EXPR \read(*var_1_15_Pointer) [L50] EXPR \read(*var_1_15_Pointer) [L50] unsigned char stepLocal_1 = (*(var_1_15_Pointer)) > (*(var_1_15_Pointer)); [L51] EXPR \read(*var_1_3_Pointer) [L51] unsigned char stepLocal_0 = (*(var_1_3_Pointer)); [L52] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L52] COND FALSE !((*(var_1_2_Pointer)) && stepLocal_0) [L59] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L59] COND TRUE (*(var_1_2_Pointer)) [L60] EXPR \read(*var_1_10_Pointer) [L60] EXPR \read(*var_1_11_Pointer) [L60] (*(var_1_9_Pointer)) = ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))) [L68] EXPR \read(*var_1_1_Pointer) [L68] signed long int stepLocal_2 = (*(var_1_1_Pointer)); [L69] COND FALSE !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u)))) [L72] EXPR \read(*var_1_13_Pointer) [L72] EXPR \read(*var_1_14_Pointer) [L72] EXPR \read(*var_1_11_Pointer) [L72] (*(var_1_12_Pointer)) = (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer))) [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR \read(*var_1_2_Pointer) [L97] EXPR (*(var_1_2_Pointer)) && (*(var_1_3_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (*(var_1_2_Pointer)) && (*(var_1_3_Pointer)) [L97] EXPR \read(*var_1_3_Pointer) [L97] EXPR (*(var_1_2_Pointer)) && (*(var_1_3_Pointer)) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR ((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1 [L97] EXPR ((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1 VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer)))))) [L97] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))) [L97] EXPR \read(*var_1_9_Pointer) [L97] EXPR \read(*var_1_10_Pointer) [L97] EXPR \read(*var_1_11_Pointer) [L97] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR ((((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))))) && (((*(var_1_1_Pointer)) <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? ((*(var_1_12_Pointer)) == ((double) ((*(var_1_10_Pointer)) - 99.5))) : ((*(var_1_12_Pointer)) == ((double) (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR ((((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))))) && (((*(var_1_1_Pointer)) <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? ((*(var_1_12_Pointer)) == ((double) ((*(var_1_10_Pointer)) - 99.5))) : ((*(var_1_12_Pointer)) == ((double) (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer)))))) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (((((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))))) && (((*(var_1_1_Pointer)) <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? ((*(var_1_12_Pointer)) == ((double) ((*(var_1_10_Pointer)) - 99.5))) : ((*(var_1_12_Pointer)) == ((double) (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer))))))) && ((0.8f > (- (*(var_1_10_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97] EXPR (((((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))))) && (((*(var_1_1_Pointer)) <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? ((*(var_1_12_Pointer)) == ((double) ((*(var_1_10_Pointer)) - 99.5))) : ((*(var_1_12_Pointer)) == ((double) (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer))))))) && ((0.8f > (- (*(var_1_10_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L97-L98] return (((((*(var_1_2_Pointer)) && (*(var_1_3_Pointer))) ? (((*(var_1_2_Pointer)) && ((*(var_1_15_Pointer)) > (*(var_1_15_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((*(var_1_15_Pointer)) - (*(var_1_15_Pointer))))) : ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_15_Pointer)) + 5) - (*(var_1_15_Pointer)))))) : 1) && ((*(var_1_2_Pointer)) ? ((*(var_1_9_Pointer)) == ((float) ((*(var_1_10_Pointer)) - (*(var_1_11_Pointer))))) : (((*(var_1_1_Pointer)) < (*(var_1_15_Pointer))) ? ((*(var_1_9_Pointer)) == ((float) (((((*(var_1_11_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_11_Pointer))) : ((*(var_1_10_Pointer))))))) : ((*(var_1_9_Pointer)) == ((float) (*(var_1_10_Pointer))))))) && (((*(var_1_1_Pointer)) <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? ((*(var_1_12_Pointer)) == ((double) ((*(var_1_10_Pointer)) - 99.5))) : ((*(var_1_12_Pointer)) == ((double) (((*(var_1_13_Pointer)) - (*(var_1_14_Pointer))) - (*(var_1_11_Pointer))))))) && ((0.8f > (- (*(var_1_10_Pointer)))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={8:0}, var_1_10_Pointer={8:0}, var_1_11={9:0}, var_1_11_Pointer={9:0}, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_9={7:0}, var_1_9_Pointer={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 139 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 828 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 464 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 364 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 568 NumberOfCodeBlocks, 568 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 467 ConstructedInterpolants, 0 QuantifiedInterpolants, 804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 855/900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:50:45,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.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 9ed7d52db15c526d7f8d423512adcea77404e9fba9479175fb6f6fa9d9e8b07d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:50:47,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:50:47,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:50:47,327 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:50:47,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:50:47,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:50:47,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:50:47,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:50:47,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:50:47,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:50:47,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:50:47,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:50:47,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:50:47,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:50:47,352 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:50:47,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:50:47,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:50:47,354 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:50:47,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:50:47,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:50:47,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:50:47,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:50:47,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:50:47,355 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:50:47,355 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:50:47,355 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:50:47,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:50:47,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:50:47,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:50:47,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:50:47,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:50:47,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:50:47,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:50:47,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:50:47,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:50:47,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:50:47,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:50:47,356 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:50:47,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:50:47,356 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:50:47,356 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:50:47,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:50:47,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:50:47,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:50:47,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:50:47,356 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 -> 9ed7d52db15c526d7f8d423512adcea77404e9fba9479175fb6f6fa9d9e8b07d [2025-03-17 05:50:47,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:50:47,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:50:47,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:50:47,596 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:50:47,596 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:50:47,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i [2025-03-17 05:50:48,742 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00199bce2/6f2d78d31b8147228834f2def6202e3c/FLAG1b6a6333d [2025-03-17 05:50:48,934 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:50:48,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i [2025-03-17 05:50:48,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00199bce2/6f2d78d31b8147228834f2def6202e3c/FLAG1b6a6333d [2025-03-17 05:50:49,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00199bce2/6f2d78d31b8147228834f2def6202e3c [2025-03-17 05:50:49,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:50:49,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:50:49,317 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:50:49,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:50:49,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:50:49,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:50:49" (1/1) ... [2025-03-17 05:50:49,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab1799c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:49, skipping insertion in model container [2025-03-17 05:50:49,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:50:49" (1/1) ... [2025-03-17 05:50:49,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:50:49,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i[916,929] [2025-03-17 05:50:49,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:50:49,482 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:50:49,489 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-78.i[916,929] [2025-03-17 05:50:49,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:50:49,520 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:50:49,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:49 WrapperNode [2025-03-17 05:50:49,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:50:49,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:50:49,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:50:49,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:50:49,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:49" (1/1) ... [2025-03-17 05:50:49,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:49" (1/1) ... [2025-03-17 05:50:49,556 INFO L138 Inliner]: procedures = 36, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 439 [2025-03-17 05:50:49,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:50:49,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:50:49,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:50:49,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:50:49,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:49" (1/1) ... [2025-03-17 05:50:49,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:49" (1/1) ... [2025-03-17 05:50:49,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:49" (1/1) ... [2025-03-17 05:50:49,592 INFO L175 MemorySlicer]: Split 110 memory accesses to 12 slices as follows [2, 9, 10, 6, 7, 18, 14, 5, 8, 8, 17, 6]. 16 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1]. [2025-03-17 05:50:49,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:49" (1/1) ... [2025-03-17 05:50:49,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:49" (1/1) ... [2025-03-17 05:50:49,610 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:49" (1/1) ... [2025-03-17 05:50:49,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:49" (1/1) ... [2025-03-17 05:50:49,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:49" (1/1) ... [2025-03-17 05:50:49,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:49" (1/1) ... [2025-03-17 05:50:49,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:50:49,627 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:50:49,627 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:50:49,627 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:50:49,628 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:49" (1/1) ... [2025-03-17 05:50:49,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:50:49,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:50:49,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:50:49,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:50:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:50:49,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:50:49,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-17 05:50:49,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-17 05:50:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-03-17 05:50:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-03-17 05:50:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-03-17 05:50:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-03-17 05:50:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:50:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:50:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:50:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:50:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:50:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-17 05:50:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-17 05:50:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-03-17 05:50:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-17 05:50:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:50:49,681 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:50:49,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-17 05:50:49,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-17 05:50:49,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-03-17 05:50:49,865 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:50:49,867 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:50:54,130 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~short74#1;havoc property_#t~ite86#1;havoc property_#t~mem77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~short78#1;havoc property_#t~ite85#1;havoc property_#t~mem81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem87#1;havoc property_#t~ite102#1;havoc property_#t~mem90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite101#1;havoc property_#t~mem98#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite111#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~short112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~short117#1; [2025-03-17 05:50:54,160 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-03-17 05:50:54,161 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:50:54,168 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:50:54,168 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:50:54,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:50:54 BoogieIcfgContainer [2025-03-17 05:50:54,168 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:50:54,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:50:54,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:50:54,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:50:54,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:50:49" (1/3) ... [2025-03-17 05:50:54,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7297698b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:50:54, skipping insertion in model container [2025-03-17 05:50:54,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:50:49" (2/3) ... [2025-03-17 05:50:54,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7297698b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:50:54, skipping insertion in model container [2025-03-17 05:50:54,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:50:54" (3/3) ... [2025-03-17 05:50:54,175 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-78.i [2025-03-17 05:50:54,186 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:50:54,187 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-78.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:50:54,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:50:54,236 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;@49de4fca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:50:54,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:50:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 05:50:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:50:54,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:54,248 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:54,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:54,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:54,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2006130283, now seen corresponding path program 1 times [2025-03-17 05:50:54,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:50:54,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978261266] [2025-03-17 05:50:54,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:54,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:50:54,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:50:54,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:50:54,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:50:54,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:50:54,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:50:54,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:54,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:54,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:50:54,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-17 05:50:54,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:50:54,666 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:50:54,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978261266] [2025-03-17 05:50:54,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978261266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:54,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:54,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:50:54,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739854070] [2025-03-17 05:50:54,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:54,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:50:54,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:50:54,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:50:54,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:50:54,682 INFO L87 Difference]: Start difference. First operand has 87 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 05:50:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:54,716 INFO L93 Difference]: Finished difference Result 171 states and 266 transitions. [2025-03-17 05:50:54,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:50:54,718 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 94 [2025-03-17 05:50:54,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:54,722 INFO L225 Difference]: With dead ends: 171 [2025-03-17 05:50:54,722 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 05:50:54,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:50:54,725 INFO L435 NwaCegarLoop]: 125 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, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:54,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:50:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 05:50:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 05:50:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 05:50:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2025-03-17 05:50:54,761 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 94 [2025-03-17 05:50:54,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:54,761 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2025-03-17 05:50:54,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 05:50:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2025-03-17 05:50:54,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:50:54,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:54,764 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:54,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:50:54,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:50:54,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:54,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:54,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1408723291, now seen corresponding path program 1 times [2025-03-17 05:50:54,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:50:54,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192776932] [2025-03-17 05:50:54,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:54,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:50:54,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:50:54,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:50:54,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:50:55,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:50:55,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:50:55,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:55,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:55,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:50:55,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 05:50:55,625 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:50:55,625 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:50:55,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192776932] [2025-03-17 05:50:55,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192776932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:55,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:55,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:50:55,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636832261] [2025-03-17 05:50:55,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:55,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:50:55,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:50:55,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:50:55,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:50:55,629 INFO L87 Difference]: Start difference. First operand 85 states and 125 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 05:50:57,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:50:57,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:57,445 INFO L93 Difference]: Finished difference Result 253 states and 373 transitions. [2025-03-17 05:50:57,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:50:57,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 94 [2025-03-17 05:50:57,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:57,447 INFO L225 Difference]: With dead ends: 253 [2025-03-17 05:50:57,448 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 05:50:57,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:50:57,450 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 70 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:57,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 345 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 05:50:57,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 05:50:57,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2025-03-17 05:50:57,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 143 states have (on average 1.4335664335664335) internal successors, (205), 143 states have internal predecessors, (205), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:50:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 245 transitions. [2025-03-17 05:50:57,471 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 245 transitions. Word has length 94 [2025-03-17 05:50:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:57,472 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 245 transitions. [2025-03-17 05:50:57,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 05:50:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2025-03-17 05:50:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:50:57,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:57,473 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:57,488 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 (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:50:57,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:50:57,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:57,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:57,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1914281916, now seen corresponding path program 1 times [2025-03-17 05:50:57,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:50:57,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205796518] [2025-03-17 05:50:57,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:57,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:50:57,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:50:57,678 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:50:57,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:50:57,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:50:58,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:50:58,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:58,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:58,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:50:58,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 05:50:58,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:50:58,068 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:50:58,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205796518] [2025-03-17 05:50:58,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205796518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:58,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:58,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:50:58,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101459069] [2025-03-17 05:50:58,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:58,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:50:58,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:50:58,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:50:58,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:50:58,069 INFO L87 Difference]: Start difference. First operand 166 states and 245 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 05:50:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:50:58,101 INFO L93 Difference]: Finished difference Result 335 states and 495 transitions. [2025-03-17 05:50:58,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:50:58,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 94 [2025-03-17 05:50:58,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:50:58,103 INFO L225 Difference]: With dead ends: 335 [2025-03-17 05:50:58,103 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 05:50:58,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:50:58,104 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:50:58,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:50:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 05:50:58,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-17 05:50:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 147 states have (on average 1.4217687074829932) internal successors, (209), 147 states have internal predecessors, (209), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:50:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 249 transitions. [2025-03-17 05:50:58,119 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 249 transitions. Word has length 94 [2025-03-17 05:50:58,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:50:58,120 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 249 transitions. [2025-03-17 05:50:58,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-17 05:50:58,120 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 249 transitions. [2025-03-17 05:50:58,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:50:58,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:50:58,121 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:50:58,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:50:58,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:50:58,326 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:50:58,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:50:58,326 INFO L85 PathProgramCache]: Analyzing trace with hash -513605790, now seen corresponding path program 1 times [2025-03-17 05:50:58,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:50:58,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554822411] [2025-03-17 05:50:58,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:50:58,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:50:58,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:50:58,330 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:50:58,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 05:50:58,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:50:58,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:50:58,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:50:58,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:50:58,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:50:58,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:50:58,835 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 77 treesize of output 41 [2025-03-17 05:50:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 05:50:58,861 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:50:58,861 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:50:58,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554822411] [2025-03-17 05:50:58,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554822411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:50:58,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:50:58,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:50:58,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804808506] [2025-03-17 05:50:58,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:50:58,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:50:58,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:50:58,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:50:58,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:50:58,862 INFO L87 Difference]: Start difference. First operand 170 states and 249 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 05:51:00,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:51:01,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:51:02,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:02,077 INFO L93 Difference]: Finished difference Result 341 states and 499 transitions. [2025-03-17 05:51:02,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:51:02,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2025-03-17 05:51:02,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:02,083 INFO L225 Difference]: With dead ends: 341 [2025-03-17 05:51:02,083 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 05:51:02,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:51:02,086 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 107 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:02,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 352 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-17 05:51:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 05:51:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2025-03-17 05:51:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 147 states have (on average 1.4081632653061225) internal successors, (207), 147 states have internal predecessors, (207), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:51:02,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 247 transitions. [2025-03-17 05:51:02,187 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 247 transitions. Word has length 96 [2025-03-17 05:51:02,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:02,187 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 247 transitions. [2025-03-17 05:51:02,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 05:51:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 247 transitions. [2025-03-17 05:51:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 05:51:02,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:02,188 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:02,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:51:02,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:51:02,390 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:02,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:02,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1806924868, now seen corresponding path program 1 times [2025-03-17 05:51:02,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:51:02,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069612991] [2025-03-17 05:51:02,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:02,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:51:02,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:51:02,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:51:02,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 05:51:02,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 05:51:02,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 05:51:02,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:02,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:02,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:51:02,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:02,999 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 77 treesize of output 41 [2025-03-17 05:51:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-17 05:51:03,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:51:03,023 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:51:03,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069612991] [2025-03-17 05:51:03,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069612991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:03,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:03,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:03,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088448551] [2025-03-17 05:51:03,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:03,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:51:03,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:51:03,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:51:03,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:03,024 INFO L87 Difference]: Start difference. First operand 170 states and 247 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 05:51:04,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:51:07,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:51:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:07,248 INFO L93 Difference]: Finished difference Result 341 states and 495 transitions. [2025-03-17 05:51:07,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:51:07,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2025-03-17 05:51:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:07,250 INFO L225 Difference]: With dead ends: 341 [2025-03-17 05:51:07,250 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 05:51:07,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:51:07,251 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 99 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:07,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 354 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 05:51:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 05:51:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2025-03-17 05:51:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 147 states have (on average 1.3945578231292517) internal successors, (205), 147 states have internal predecessors, (205), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:51:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 245 transitions. [2025-03-17 05:51:07,268 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 245 transitions. Word has length 98 [2025-03-17 05:51:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:07,269 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 245 transitions. [2025-03-17 05:51:07,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 05:51:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 245 transitions. [2025-03-17 05:51:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 05:51:07,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:07,270 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:07,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 05:51:07,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:51:07,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:07,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:07,472 INFO L85 PathProgramCache]: Analyzing trace with hash 71775458, now seen corresponding path program 1 times [2025-03-17 05:51:07,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:51:07,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314403375] [2025-03-17 05:51:07,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:07,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:51:07,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:51:07,474 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:51:07,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 05:51:07,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 05:51:08,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 05:51:08,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:08,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:08,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:51:08,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:08,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:51:08,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2025-03-17 05:51:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-17 05:51:08,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:51:08,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:51:08,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314403375] [2025-03-17 05:51:08,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314403375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:08,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:51:08,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:51:08,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055431304] [2025-03-17 05:51:08,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:08,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:51:08,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:51:08,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:51:08,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:51:08,275 INFO L87 Difference]: Start difference. First operand 170 states and 245 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 05:51:09,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:51:12,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:51:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:13,303 INFO L93 Difference]: Finished difference Result 341 states and 491 transitions. [2025-03-17 05:51:13,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:51:13,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2025-03-17 05:51:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:13,305 INFO L225 Difference]: With dead ends: 341 [2025-03-17 05:51:13,305 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 05:51:13,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:51:13,306 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 83 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:13,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 353 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-17 05:51:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 05:51:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2025-03-17 05:51:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 147 states have (on average 1.380952380952381) internal successors, (203), 147 states have internal predecessors, (203), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:51:13,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 243 transitions. [2025-03-17 05:51:13,314 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 243 transitions. Word has length 100 [2025-03-17 05:51:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:13,314 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 243 transitions. [2025-03-17 05:51:13,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 05:51:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 243 transitions. [2025-03-17 05:51:13,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:51:13,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:13,315 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:13,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 05:51:13,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:51:13,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:13,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:13,516 INFO L85 PathProgramCache]: Analyzing trace with hash -809687040, now seen corresponding path program 1 times [2025-03-17 05:51:13,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:51:13,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208824991] [2025-03-17 05:51:13,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:13,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:51:13,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:51:13,519 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:51:13,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 05:51:13,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:51:25,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:51:25,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:25,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:25,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-17 05:51:25,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:30,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:51:35,816 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 237 treesize of output 177 [2025-03-17 05:51:35,826 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 201 treesize of output 141 [2025-03-17 05:51:35,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 83 [2025-03-17 05:51:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 4 proven. 128 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 05:51:37,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:51:48,983 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:51:48,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208824991] [2025-03-17 05:51:48,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208824991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:51:48,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1560714348] [2025-03-17 05:51:48,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:48,983 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:51:48,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:51:48,985 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-17 05:51:48,989 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-17 05:51:49,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:51:49,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:51:49,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:51:49,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:51:50,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:51:50,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:51:51,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:51:51,602 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 157 treesize of output 67 [2025-03-17 05:51:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 05:51:52,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:51:52,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1560714348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:51:52,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:51:52,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [21] total 25 [2025-03-17 05:51:52,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368002739] [2025-03-17 05:51:52,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:51:52,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:51:52,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:51:52,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:51:52,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2025-03-17 05:51:52,345 INFO L87 Difference]: Start difference. First operand 170 states and 243 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 05:51:54,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:51:57,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:51:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:51:58,098 INFO L93 Difference]: Finished difference Result 341 states and 487 transitions. [2025-03-17 05:51:58,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:51:58,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2025-03-17 05:51:58,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:51:58,102 INFO L225 Difference]: With dead ends: 341 [2025-03-17 05:51:58,102 INFO L226 Difference]: Without dead ends: 172 [2025-03-17 05:51:58,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 05:51:58,103 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 89 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:51:58,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 352 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-17 05:51:58,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-17 05:51:58,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2025-03-17 05:51:58,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 147 states have (on average 1.3673469387755102) internal successors, (201), 147 states have internal predecessors, (201), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:51:58,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 241 transitions. [2025-03-17 05:51:58,111 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 241 transitions. Word has length 102 [2025-03-17 05:51:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:51:58,112 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 241 transitions. [2025-03-17 05:51:58,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-17 05:51:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 241 transitions. [2025-03-17 05:51:58,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:51:58,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:51:58,113 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:51:58,126 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-17 05:51:58,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 05:51:58,513 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-17 05:51:58,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:51:58,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:51:58,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1031125602, now seen corresponding path program 1 times [2025-03-17 05:51:58,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:51:58,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983331577] [2025-03-17 05:51:58,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:51:58,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:51:58,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:51:58,517 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:51:58,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-17 05:51:58,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:52:09,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:52:09,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:52:09,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:52:09,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 05:52:09,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:52:13,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:52:19,161 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 237 treesize of output 177 [2025-03-17 05:52:19,169 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 201 treesize of output 141 [2025-03-17 05:52:19,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 83 [2025-03-17 05:52:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 4 proven. 128 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 05:52:20,572 INFO L312 TraceCheckSpWp]: Computing backward predicates...