./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 803046ced68b079bb7f08c78720a8843883361424ea99724f710829affe474a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:25:31,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:25:31,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:25:31,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:25:31,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:25:31,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:25:31,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:25:31,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:25:31,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:25:31,985 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:25:31,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:25:31,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:25:31,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:25:31,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:25:31,986 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:25:31,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:25:31,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:25:31,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:25:31,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:25:31,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:25:31,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:25:31,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:25:31,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:25:31,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:25:31,987 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:25:31,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:25:31,987 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:25:31,987 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:25:31,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:25:31,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:25:31,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:25:31,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:25:31,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:31,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:25:31,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:25:31,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:25:31,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:25:31,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:31,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:25:31,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:25:31,988 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:25:31,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:25:31,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:25:31,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:25:31,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:25:31,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:25:31,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:25:31,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:25:31,989 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-jdk21/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 -> 803046ced68b079bb7f08c78720a8843883361424ea99724f710829affe474a7 [2025-01-09 15:25:32,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:25:32,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:25:32,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:25:32,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:25:32,200 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:25:32,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.i [2025-01-09 15:25:33,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52deaf65f/d14734613e444c3591fc308be4e202fd/FLAG195af4865 [2025-01-09 15:25:33,515 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:25:33,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.i [2025-01-09 15:25:33,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52deaf65f/d14734613e444c3591fc308be4e202fd/FLAG195af4865 [2025-01-09 15:25:33,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/52deaf65f/d14734613e444c3591fc308be4e202fd [2025-01-09 15:25:33,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:25:33,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:25:33,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:25:33,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:25:33,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:25:33,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:25:33" (1/1) ... [2025-01-09 15:25:33,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14924845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:33, skipping insertion in model container [2025-01-09 15:25:33,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:25:33" (1/1) ... [2025-01-09 15:25:33,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:25:33,972 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.i[915,928] [2025-01-09 15:25:34,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:25:34,031 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:25:34,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.i[915,928] [2025-01-09 15:25:34,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:25:34,085 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:25:34,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:34 WrapperNode [2025-01-09 15:25:34,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:25:34,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:25:34,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:25:34,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:25:34,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:34" (1/1) ... [2025-01-09 15:25:34,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:34" (1/1) ... [2025-01-09 15:25:34,116 INFO L138 Inliner]: procedures = 29, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2025-01-09 15:25:34,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:25:34,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:25:34,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:25:34,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:25:34,122 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:34" (1/1) ... [2025-01-09 15:25:34,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:34" (1/1) ... [2025-01-09 15:25:34,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:34" (1/1) ... [2025-01-09 15:25:34,144 INFO L175 MemorySlicer]: Split 122 memory accesses to 7 slices as follows [2, 18, 28, 22, 33, 8, 11]. 27 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 2, 2, 2, 1, 1]. The 16 writes are split as follows [0, 2, 4, 2, 4, 3, 1]. [2025-01-09 15:25:34,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:34" (1/1) ... [2025-01-09 15:25:34,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:34" (1/1) ... [2025-01-09 15:25:34,161 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:34" (1/1) ... [2025-01-09 15:25:34,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:34" (1/1) ... [2025-01-09 15:25:34,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:34" (1/1) ... [2025-01-09 15:25:34,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:34" (1/1) ... [2025-01-09 15:25:34,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:34" (1/1) ... [2025-01-09 15:25:34,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:25:34,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:25:34,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:25:34,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:25:34,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:34" (1/1) ... [2025-01-09 15:25:34,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:34,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:34,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:25:34,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:25:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:25:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:25:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:25:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:25:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:25:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:25:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:25:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:25:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:25:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:25:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:25:34,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:25:34,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:25:34,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:25:34,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:25:34,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:25:34,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:25:34,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:25:34,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:25:34,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:25:34,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:25:34,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:25:34,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:25:34,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:25:34,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:25:34,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:25:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:25:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:25:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:25:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:25:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:25:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:25:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:25:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:25:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:25:34,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:25:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:25:34,220 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:25:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:25:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:25:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:25:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:25:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:25:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:25:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:25:34,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:25:34,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:25:34,328 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:25:34,329 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:25:34,694 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2025-01-09 15:25:34,694 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:25:34,706 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:25:34,706 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:25:34,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:25:34 BoogieIcfgContainer [2025-01-09 15:25:34,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:25:34,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:25:34,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:25:34,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:25:34,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:25:33" (1/3) ... [2025-01-09 15:25:34,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbe6e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:25:34, skipping insertion in model container [2025-01-09 15:25:34,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:34" (2/3) ... [2025-01-09 15:25:34,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbe6e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:25:34, skipping insertion in model container [2025-01-09 15:25:34,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:25:34" (3/3) ... [2025-01-09 15:25:34,714 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-7.i [2025-01-09 15:25:34,724 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:25:34,726 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-7.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:25:34,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:25:34,777 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;@2cf78206, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:25:34,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:25:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:25:34,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:34,789 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:34,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:34,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:34,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1953463655, now seen corresponding path program 1 times [2025-01-09 15:25:34,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:34,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086167107] [2025-01-09 15:25:34,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:34,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:34,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:25:34,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:25:34,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:34,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 15:25:35,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:35,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086167107] [2025-01-09 15:25:35,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086167107] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:25:35,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799191799] [2025-01-09 15:25:35,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:35,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:25:35,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:35,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:25:35,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:25:35,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:25:35,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:25:35,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:35,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:35,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:25:35,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 15:25:35,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:35,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799191799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:35,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:25:35,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:25:35,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659537949] [2025-01-09 15:25:35,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:35,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:25:35,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:35,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:25:35,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:25:35,245 INFO L87 Difference]: Start difference. First operand has 99 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:35,269 INFO L93 Difference]: Finished difference Result 192 states and 301 transitions. [2025-01-09 15:25:35,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:25:35,270 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-01-09 15:25:35,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:35,274 INFO L225 Difference]: With dead ends: 192 [2025-01-09 15:25:35,275 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 15:25:35,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-01-09 15:25:35,281 INFO L435 NwaCegarLoop]: 138 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, 138 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-01-09 15:25:35,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 15:25:35,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-09 15:25:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-01-09 15:25:35,307 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 103 [2025-01-09 15:25:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:35,307 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-01-09 15:25:35,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:35,308 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-01-09 15:25:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:25:35,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:35,310 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:35,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:25:35,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:25:35,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:35,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:35,511 INFO L85 PathProgramCache]: Analyzing trace with hash 735972523, now seen corresponding path program 1 times [2025-01-09 15:25:35,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:35,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857977736] [2025-01-09 15:25:35,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:35,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:35,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:25:35,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:25:35,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:35,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:35,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:35,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857977736] [2025-01-09 15:25:35,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857977736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:35,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:35,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:25:35,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977896938] [2025-01-09 15:25:35,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:35,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:25:35,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:35,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:25:35,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:25:35,674 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:35,703 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2025-01-09 15:25:35,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:25:35,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-01-09 15:25:35,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:35,706 INFO L225 Difference]: With dead ends: 190 [2025-01-09 15:25:35,707 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 15:25:35,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:25:35,708 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:35,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 15:25:35,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 15:25:35,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-01-09 15:25:35,722 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 103 [2025-01-09 15:25:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:35,723 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-01-09 15:25:35,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-01-09 15:25:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:25:35,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:35,724 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:35,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:25:35,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:35,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:35,724 INFO L85 PathProgramCache]: Analyzing trace with hash -275144727, now seen corresponding path program 1 times [2025-01-09 15:25:35,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:35,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201572435] [2025-01-09 15:25:35,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:35,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:35,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:25:35,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:25:35,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:35,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:36,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:36,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201572435] [2025-01-09 15:25:36,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201572435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:36,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:36,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:36,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323104522] [2025-01-09 15:25:36,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:36,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:36,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:36,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:36,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:36,775 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:36,940 INFO L93 Difference]: Finished difference Result 228 states and 328 transitions. [2025-01-09 15:25:36,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:25:36,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-01-09 15:25:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:36,942 INFO L225 Difference]: With dead ends: 228 [2025-01-09 15:25:36,942 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 15:25:36,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:25:36,943 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 111 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:36,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 722 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 15:25:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2025-01-09 15:25:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3693693693693694) internal successors, (152), 112 states have internal predecessors, (152), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:25:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 190 transitions. [2025-01-09 15:25:36,954 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 190 transitions. Word has length 103 [2025-01-09 15:25:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:36,954 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 190 transitions. [2025-01-09 15:25:36,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 190 transitions. [2025-01-09 15:25:36,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 15:25:36,955 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:36,955 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:36,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:25:36,956 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:36,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:36,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1824647486, now seen corresponding path program 1 times [2025-01-09 15:25:36,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:36,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481287348] [2025-01-09 15:25:36,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:36,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:36,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:25:37,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:25:37,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:37,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:37,593 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:37,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:37,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481287348] [2025-01-09 15:25:37,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481287348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:37,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:37,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:25:37,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659852069] [2025-01-09 15:25:37,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:37,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:25:37,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:37,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:25:37,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:37,597 INFO L87 Difference]: Start difference. First operand 133 states and 190 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:37,790 INFO L93 Difference]: Finished difference Result 234 states and 332 transitions. [2025-01-09 15:25:37,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:25:37,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-01-09 15:25:37,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:37,793 INFO L225 Difference]: With dead ends: 234 [2025-01-09 15:25:37,793 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 15:25:37,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:25:37,795 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 107 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:37,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 884 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 15:25:37,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2025-01-09 15:25:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 110 states have internal predecessors, (149), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:25:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 187 transitions. [2025-01-09 15:25:37,810 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 187 transitions. Word has length 105 [2025-01-09 15:25:37,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:37,812 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 187 transitions. [2025-01-09 15:25:37,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 187 transitions. [2025-01-09 15:25:37,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 15:25:37,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:37,813 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:37,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:25:37,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:37,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:37,815 INFO L85 PathProgramCache]: Analyzing trace with hash -50150142, now seen corresponding path program 1 times [2025-01-09 15:25:37,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:37,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079298820] [2025-01-09 15:25:37,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:37,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:37,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 15:25:37,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 15:25:37,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:37,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:37,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:25:37,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079298820] [2025-01-09 15:25:37,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079298820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:37,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:37,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:25:37,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189631221] [2025-01-09 15:25:37,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:37,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:25:37,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:25:37,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:25:37,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:25:37,866 INFO L87 Difference]: Start difference. First operand 131 states and 187 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:37,880 INFO L93 Difference]: Finished difference Result 230 states and 327 transitions. [2025-01-09 15:25:37,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:25:37,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2025-01-09 15:25:37,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:37,883 INFO L225 Difference]: With dead ends: 230 [2025-01-09 15:25:37,883 INFO L226 Difference]: Without dead ends: 132 [2025-01-09 15:25:37,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:25:37,884 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:37,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-09 15:25:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-01-09 15:25:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.3636363636363635) internal successors, (150), 111 states have internal predecessors, (150), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:25:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2025-01-09 15:25:37,894 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 106 [2025-01-09 15:25:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:37,895 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2025-01-09 15:25:37,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2025-01-09 15:25:37,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 15:25:37,897 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:37,897 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:37,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:25:37,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:37,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash 629908228, now seen corresponding path program 1 times [2025-01-09 15:25:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:25:37,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52130577] [2025-01-09 15:25:37,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:37,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:25:37,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 15:25:37,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 15:25:37,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:37,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:25:37,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [628285309] [2025-01-09 15:25:37,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:37,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:25:37,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:37,987 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:25:37,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:25:38,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 15:25:38,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 15:25:38,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:38,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:25:38,280 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:25:38,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 15:25:38,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 15:25:38,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:38,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:25:38,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:25:38,415 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:25:38,416 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:25:38,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:25:38,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:25:38,620 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 15:25:38,682 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:25:38,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:25:38 BoogieIcfgContainer [2025-01-09 15:25:38,684 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:25:38,685 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:25:38,685 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:25:38,685 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:25:38,686 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:25:34" (3/4) ... [2025-01-09 15:25:38,688 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:25:38,688 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:25:38,689 INFO L158 Benchmark]: Toolchain (without parser) took 4827.72ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 113.2MB in the beginning and 71.3MB in the end (delta: 41.9MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. [2025-01-09 15:25:38,689 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:25:38,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.52ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.2MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:25:38,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.23ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 94.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:25:38,689 INFO L158 Benchmark]: Boogie Preprocessor took 57.21ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 89.8MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:25:38,689 INFO L158 Benchmark]: RCFGBuilder took 532.68ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 57.8MB in the end (delta: 32.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 15:25:38,689 INFO L158 Benchmark]: TraceAbstraction took 3976.08ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 57.3MB in the beginning and 71.3MB in the end (delta: -14.0MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2025-01-09 15:25:38,690 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 192.9MB. Free memory was 71.3MB in the beginning and 71.3MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:25:38,690 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.21ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.52ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 98.2MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.23ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 94.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.21ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 89.8MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 532.68ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 57.8MB in the end (delta: 32.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3976.08ms. Allocated memory was 142.6MB in the beginning and 192.9MB in the end (delta: 50.3MB). Free memory was 57.3MB in the beginning and 71.3MB in the end (delta: -14.0MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 192.9MB. Free memory was 71.3MB in the beginning and 71.3MB in the end (delta: 36.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 83. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 1 }; [L25-L27] double double_Array_0[2] = { 0.2, 127.5 }; [L25-L27] double double_Array_0[2] = { 0.2, 127.5 }; [L25-L27] double double_Array_0[2] = { 0.2, 127.5 }; [L28-L30] float float_Array_0[2] = { 100000000000.4, 8.2 }; [L28-L30] float float_Array_0[2] = { 100000000000.4, 8.2 }; [L28-L30] float float_Array_0[2] = { 100000000000.4, 8.2 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 1 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 1 }; [L31-L33] unsigned char unsigned_char_Array_0[2] = { 4, 1 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 5 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 5 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L40] double last_1_double_Array_0_0_ = 0.2; [L41] unsigned long int last_1_unsigned_long_int_Array_0_0_ = 5; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] isInitial = 1 [L106] FCALL initially() [L108] CALL updateLastVariables() [L97] EXPR double_Array_0[0] [L97] last_1_double_Array_0_0_ = double_Array_0[0] [L98] EXPR unsigned_long_int_Array_0[0] [L98] last_1_unsigned_long_int_Array_0_0_ = unsigned_long_int_Array_0[0] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L76] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] double_Array_0[1] = __VERIFIER_nondet_double() [L83] EXPR double_Array_0[1] [L83] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L83] EXPR double_Array_0[1] [L83] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] float_Array_0[0] = __VERIFIER_nondet_float() [L85] EXPR float_Array_0[0] [L85] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F [L85] EXPR float_Array_0[0] [L85] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] float_Array_0[1] = __VERIFIER_nondet_float() [L87] EXPR float_Array_0[1] [L87] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L87] EXPR float_Array_0[1] [L87] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_short_int_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L109] RET updateVariables() [L110] CALL step() [L45] EXPR float_Array_0[1] [L45] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) [L52] EXPR unsigned_char_Array_0[0] [L52] unsigned_char_Array_0[1] = unsigned_char_Array_0[0] [L54] EXPR BOOL_unsigned_char_Array_0[0] [L54] BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L54] BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1]) [L54] EXPR unsigned_char_Array_0[0] [L54] EXPR unsigned_short_int_Array_0[0] [L54] EXPR unsigned_char_Array_0[1] [L54] BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L54] COND FALSE !(BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) [L61] EXPR double_Array_0[1] [L61] double_Array_0[0] = double_Array_0[1] [L63] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L63] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L72] EXPR unsigned_char_Array_0[0] [L72] unsigned_long_int_Array_0[0] = unsigned_char_Array_0[0] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR float_Array_0[1] [L101] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) [L101] EXPR unsigned_char_Array_0[1] [L101] EXPR unsigned_char_Array_0[0] [L101] EXPR (! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) [L101] EXPR BOOL_unsigned_char_Array_0[0] [L101] EXPR BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1]) [L101] EXPR unsigned_char_Array_0[0] [L101] EXPR unsigned_short_int_Array_0[0] [L101] EXPR unsigned_char_Array_0[1] [L101] EXPR BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) [L101] EXPR double_Array_0[0] [L101] EXPR double_Array_0[1] [L101] EXPR (BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])))) && (BOOL_unsigned_char_Array_0[0] ? ((BOOL_unsigned_char_Array_0[1] && (float_Array_0[0] <= double_Array_0[0])) ? ((((((float_Array_0[0]) > (double_Array_0[1])) ? (float_Array_0[0]) : (double_Array_0[1]))) > double_Array_0[0]) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((((3725801564u - unsigned_char_Array_0[0]) - unsigned_char_Array_0[1])) > (unsigned_short_int_Array_0[0])) ? (((3725801564u - unsigned_char_Array_0[0]) - unsigned_char_Array_0[1])) : (unsigned_short_int_Array_0[0]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0]))) : 1) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])))) && (BOOL_unsigned_char_Array_0[0] ? ((BOOL_unsigned_char_Array_0[1] && (float_Array_0[0] <= double_Array_0[0])) ? ((((((float_Array_0[0]) > (double_Array_0[1])) ? (float_Array_0[0]) : (double_Array_0[1]))) > double_Array_0[0]) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((((3725801564u - unsigned_char_Array_0[0]) - unsigned_char_Array_0[1])) > (unsigned_short_int_Array_0[0])) ? (((3725801564u - unsigned_char_Array_0[0]) - unsigned_char_Array_0[1])) : (unsigned_short_int_Array_0[0]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0]))) : 1) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101-L102] return (((! (last_1_double_Array_0_0_ <= (float_Array_0[1] - float_Array_0[0]))) ? ((-1 < last_1_unsigned_long_int_Array_0_0_) ? (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0]))) && ((BOOL_unsigned_char_Array_0[0] || ((unsigned_char_Array_0[0] / unsigned_short_int_Array_0[0]) >= unsigned_char_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]) ? (double_Array_0[0] == ((double) double_Array_0[1])) : (double_Array_0[0] == ((double) double_Array_0[1]))) : (double_Array_0[0] == ((double) double_Array_0[1])))) && (BOOL_unsigned_char_Array_0[0] ? ((BOOL_unsigned_char_Array_0[1] && (float_Array_0[0] <= double_Array_0[0])) ? ((((((float_Array_0[0]) > (double_Array_0[1])) ? (float_Array_0[0]) : (double_Array_0[1]))) > double_Array_0[0]) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((((3725801564u - unsigned_char_Array_0[0]) - unsigned_char_Array_0[1])) > (unsigned_short_int_Array_0[0])) ? (((3725801564u - unsigned_char_Array_0[0]) - unsigned_char_Array_0[1])) : (unsigned_short_int_Array_0[0]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0]))) : 1) : (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_char_Array_0[0]))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_double_Array_0_0_=1/5, last_1_unsigned_long_int_Array_0_0_=5, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 218 mSDsluCounter, 2277 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1522 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 229 IncrementalHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 755 mSDtfsCounter, 229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 835 NumberOfCodeBlocks, 835 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 1298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 372 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 1562/1584 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-01-09 15:25:38,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 803046ced68b079bb7f08c78720a8843883361424ea99724f710829affe474a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:25:40,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:25:40,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:25:40,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:25:40,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:25:40,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:25:40,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:25:40,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:25:40,607 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:25:40,607 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:25:40,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:25:40,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:25:40,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:25:40,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:25:40,607 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:25:40,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:25:40,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:25:40,607 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:25:40,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:25:40,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:25:40,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:25:40,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:25:40,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:25:40,608 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:25:40,608 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:25:40,608 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:25:40,608 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:25:40,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:25:40,608 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:25:40,608 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:25:40,608 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:25:40,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:25:40,608 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:25:40,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:25:40,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:40,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:25:40,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:25:40,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:25:40,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:25:40,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:40,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:25:40,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:25:40,611 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:25:40,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:25:40,611 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:25:40,611 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:25:40,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:25:40,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:25:40,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:25:40,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:25:40,612 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-jdk21/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 -> 803046ced68b079bb7f08c78720a8843883361424ea99724f710829affe474a7 [2025-01-09 15:25:40,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:25:40,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:25:40,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:25:40,867 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:25:40,868 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:25:40,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.i [2025-01-09 15:25:41,963 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a3eba433/687cd35c3f1c4f278d87d8e2a5597dd0/FLAG97ce009f8 [2025-01-09 15:25:42,155 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:25:42,156 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.i [2025-01-09 15:25:42,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a3eba433/687cd35c3f1c4f278d87d8e2a5597dd0/FLAG97ce009f8 [2025-01-09 15:25:42,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3a3eba433/687cd35c3f1c4f278d87d8e2a5597dd0 [2025-01-09 15:25:42,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:25:42,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:25:42,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:25:42,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:25:42,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:25:42,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:25:42" (1/1) ... [2025-01-09 15:25:42,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc358ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42, skipping insertion in model container [2025-01-09 15:25:42,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:25:42" (1/1) ... [2025-01-09 15:25:42,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:25:42,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.i[915,928] [2025-01-09 15:25:42,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:25:42,686 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:25:42,692 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-7.i[915,928] [2025-01-09 15:25:42,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:25:42,746 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:25:42,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42 WrapperNode [2025-01-09 15:25:42,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:25:42,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:25:42,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:25:42,748 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:25:42,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42" (1/1) ... [2025-01-09 15:25:42,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42" (1/1) ... [2025-01-09 15:25:42,790 INFO L138 Inliner]: procedures = 39, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2025-01-09 15:25:42,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:25:42,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:25:42,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:25:42,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:25:42,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42" (1/1) ... [2025-01-09 15:25:42,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42" (1/1) ... [2025-01-09 15:25:42,804 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42" (1/1) ... [2025-01-09 15:25:42,823 INFO L175 MemorySlicer]: Split 122 memory accesses to 7 slices as follows [2, 18, 28, 22, 33, 8, 11]. 27 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 2, 2, 2, 1, 1]. The 16 writes are split as follows [0, 2, 4, 2, 4, 3, 1]. [2025-01-09 15:25:42,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42" (1/1) ... [2025-01-09 15:25:42,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42" (1/1) ... [2025-01-09 15:25:42,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42" (1/1) ... [2025-01-09 15:25:42,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42" (1/1) ... [2025-01-09 15:25:42,859 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42" (1/1) ... [2025-01-09 15:25:42,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42" (1/1) ... [2025-01-09 15:25:42,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42" (1/1) ... [2025-01-09 15:25:42,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:25:42,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:25:42,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:25:42,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:25:42,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42" (1/1) ... [2025-01-09 15:25:42,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:25:42,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:25:42,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:25:42,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:25:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:25:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:25:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:25:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:25:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:25:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-01-09 15:25:42,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:25:42,923 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:25:42,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:25:42,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-01-09 15:25:42,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-01-09 15:25:43,050 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:25:43,051 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:25:45,069 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2025-01-09 15:25:45,069 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:25:45,078 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:25:45,078 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:25:45,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:25:45 BoogieIcfgContainer [2025-01-09 15:25:45,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:25:45,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:25:45,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:25:45,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:25:45,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:25:42" (1/3) ... [2025-01-09 15:25:45,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2d1fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:25:45, skipping insertion in model container [2025-01-09 15:25:45,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:25:42" (2/3) ... [2025-01-09 15:25:45,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2d1fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:25:45, skipping insertion in model container [2025-01-09 15:25:45,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:25:45" (3/3) ... [2025-01-09 15:25:45,086 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-7.i [2025-01-09 15:25:45,096 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:25:45,097 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-7.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:25:45,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:25:45,142 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;@36058c71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:25:45,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:25:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:45,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:25:45,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:45,151 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:45,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:45,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:45,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1953463655, now seen corresponding path program 1 times [2025-01-09 15:25:45,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:45,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457436359] [2025-01-09 15:25:45,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:45,167 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-01-09 15:25:45,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:45,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:45,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:45,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:25:45,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:25:45,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:45,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:45,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:25:45,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-09 15:25:45,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:45,543 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:45,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457436359] [2025-01-09 15:25:45,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457436359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:45,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:45,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:25:45,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842341659] [2025-01-09 15:25:45,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:45,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:25:45,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:45,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:25:45,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:25:45,564 INFO L87 Difference]: Start difference. First operand has 99 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:45,579 INFO L93 Difference]: Finished difference Result 192 states and 301 transitions. [2025-01-09 15:25:45,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:25:45,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-01-09 15:25:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:45,587 INFO L225 Difference]: With dead ends: 192 [2025-01-09 15:25:45,587 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 15:25:45,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-01-09 15:25:45,593 INFO L435 NwaCegarLoop]: 138 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, 138 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-01-09 15:25:45,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 15:25:45,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-09 15:25:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-01-09 15:25:45,624 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 103 [2025-01-09 15:25:45,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:45,624 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-01-09 15:25:45,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:45,626 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-01-09 15:25:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:25:45,630 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:45,630 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:45,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:45,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:45,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:45,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:45,832 INFO L85 PathProgramCache]: Analyzing trace with hash 735972523, now seen corresponding path program 1 times [2025-01-09 15:25:45,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:45,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146206641] [2025-01-09 15:25:45,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:45,832 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-01-09 15:25:45,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:45,834 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:45,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:45,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:25:46,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:25:46,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:46,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:46,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 15:25:46,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:46,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:46,175 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:46,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146206641] [2025-01-09 15:25:46,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146206641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:46,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:46,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:25:46,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494838549] [2025-01-09 15:25:46,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:46,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:25:46,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:46,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:25:46,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:25:46,177 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:46,217 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2025-01-09 15:25:46,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:25:46,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-01-09 15:25:46,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:46,221 INFO L225 Difference]: With dead ends: 190 [2025-01-09 15:25:46,221 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 15:25:46,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:25:46,222 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:46,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:25:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 15:25:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 15:25:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-01-09 15:25:46,235 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 103 [2025-01-09 15:25:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:46,236 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-01-09 15:25:46,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-01-09 15:25:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 15:25:46,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:46,239 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:46,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 15:25:46,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:46,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:46,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash -275144727, now seen corresponding path program 1 times [2025-01-09 15:25:46,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:46,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797824343] [2025-01-09 15:25:46,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:46,442 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-01-09 15:25:46,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:46,444 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:46,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:46,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 15:25:46,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 15:25:46,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:46,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:46,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:25:46,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:46,896 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-01-09 15:25:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 15:25:46,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:46,927 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:46,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797824343] [2025-01-09 15:25:46,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797824343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:46,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:46,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:25:46,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969841165] [2025-01-09 15:25:46,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:46,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:46,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:46,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:46,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:46,930 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:48,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:48,748 INFO L93 Difference]: Finished difference Result 192 states and 276 transitions. [2025-01-09 15:25:48,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:25:48,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-01-09 15:25:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:48,752 INFO L225 Difference]: With dead ends: 192 [2025-01-09 15:25:48,752 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 15:25:48,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:25:48,753 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 111 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:48,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 420 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 15:25:48,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 15:25:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-01-09 15:25:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2025-01-09 15:25:48,759 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 103 [2025-01-09 15:25:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:48,759 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2025-01-09 15:25:48,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2025-01-09 15:25:48,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 15:25:48,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:48,761 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:48,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 15:25:48,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:48,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:48,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:48,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1563404019, now seen corresponding path program 1 times [2025-01-09 15:25:48,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:48,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778490289] [2025-01-09 15:25:48,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:48,962 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-01-09 15:25:48,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:48,964 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:48,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:49,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:25:49,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:25:49,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:49,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:49,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:25:49,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-09 15:25:49,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:49,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:49,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778490289] [2025-01-09 15:25:49,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778490289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:49,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:49,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:25:49,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622956844] [2025-01-09 15:25:49,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:49,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:49,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:49,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:49,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:49,275 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:25:49,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:49,376 INFO L93 Difference]: Finished difference Result 195 states and 278 transitions. [2025-01-09 15:25:49,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:25:49,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2025-01-09 15:25:49,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:49,378 INFO L225 Difference]: With dead ends: 195 [2025-01-09 15:25:49,378 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 15:25:49,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:49,379 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:49,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:25:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 15:25:49,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-01-09 15:25:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2025-01-09 15:25:49,385 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 105 [2025-01-09 15:25:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:49,385 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2025-01-09 15:25:49,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 15:25:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2025-01-09 15:25:49,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 15:25:49,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:49,387 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:49,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:49,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:49,587 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:49,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:49,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1509011121, now seen corresponding path program 1 times [2025-01-09 15:25:49,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:49,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522369272] [2025-01-09 15:25:49,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:49,588 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-01-09 15:25:49,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:49,590 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:49,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:49,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 15:25:49,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 15:25:49,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:49,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:49,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:25:49,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:49,987 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 95 treesize of output 41 [2025-01-09 15:25:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 15:25:50,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:50,004 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:50,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522369272] [2025-01-09 15:25:50,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522369272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:50,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:50,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:25:50,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587148332] [2025-01-09 15:25:50,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:50,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:25:50,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:50,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:25:50,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:25:50,005 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:51,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:51,671 INFO L93 Difference]: Finished difference Result 192 states and 272 transitions. [2025-01-09 15:25:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:25:51,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-01-09 15:25:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:51,675 INFO L225 Difference]: With dead ends: 192 [2025-01-09 15:25:51,676 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 15:25:51,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:25:51,676 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 101 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:51,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 411 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 15:25:51,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 15:25:51,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-01-09 15:25:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 15:25:51,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2025-01-09 15:25:51,687 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 105 [2025-01-09 15:25:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:51,687 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2025-01-09 15:25:51,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 15:25:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2025-01-09 15:25:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 15:25:51,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:51,689 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:51,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2025-01-09 15:25:51,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:51,890 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:51,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:51,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1120448425, now seen corresponding path program 1 times [2025-01-09 15:25:51,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:51,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820435341] [2025-01-09 15:25:51,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:51,891 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-01-09 15:25:51,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:51,893 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:51,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:51,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 15:25:52,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 15:25:52,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:52,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:52,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:25:52,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:52,282 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-01-09 15:25:52,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2025-01-09 15:25:52,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:52,333 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 60 treesize of output 30 [2025-01-09 15:25:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:25:52,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:25:52,350 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:25:52,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820435341] [2025-01-09 15:25:52,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820435341] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:25:52,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:25:52,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:25:52,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931313038] [2025-01-09 15:25:52,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:25:52,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:25:52,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:25:52,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:25:52,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:25:52,352 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:25:52,608 INFO L93 Difference]: Finished difference Result 228 states and 319 transitions. [2025-01-09 15:25:52,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:25:52,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-01-09 15:25:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:25:52,609 INFO L225 Difference]: With dead ends: 228 [2025-01-09 15:25:52,609 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 15:25:52,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:25:52,610 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 108 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:25:52,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 555 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:25:52,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 15:25:52,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2025-01-09 15:25:52,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 112 states have internal predecessors, (146), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:25:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 184 transitions. [2025-01-09 15:25:52,617 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 184 transitions. Word has length 107 [2025-01-09 15:25:52,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:25:52,618 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 184 transitions. [2025-01-09 15:25:52,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:25:52,618 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 184 transitions. [2025-01-09 15:25:52,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 15:25:52,619 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:25:52,619 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:25:52,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:52,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:52,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:25:52,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:25:52,820 INFO L85 PathProgramCache]: Analyzing trace with hash -689424766, now seen corresponding path program 1 times [2025-01-09 15:25:52,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:25:52,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369422369] [2025-01-09 15:25:52,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:25:52,820 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-01-09 15:25:52,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:25:52,822 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:52,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -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-01-09 15:25:52,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 15:25:56,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 15:25:56,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:25:56,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:25:56,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 15:25:56,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:25:56,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:25:56,319 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 64 treesize of output 24 [2025-01-09 15:26:11,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:26:11,940 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 61 [2025-01-09 15:26:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 15:26:17,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:26:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 15:26:51,036 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:26:51,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369422369] [2025-01-09 15:26:51,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369422369] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:26:51,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:26:51,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2025-01-09 15:26:51,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116995313] [2025-01-09 15:26:51,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:26:51,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:26:51,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:26:51,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:26:51,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:26:51,037 INFO L87 Difference]: Start difference. First operand 133 states and 184 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 15:26:52,538 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-01-09 15:26:54,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:26:58,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:26:59,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:27:01,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:27:02,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:27:03,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:27:06,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:27:08,715 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-01-09 15:27:10,865 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-01-09 15:27:14,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:27:15,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []