./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a1b99a13fe789fcacb85c536e70757eaddea3ef4c22e9aee449ecb3b551f3f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:20:53,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:20:53,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:20:53,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:20:53,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:20:53,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:20:53,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:20:53,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:20:53,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:20:53,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:20:53,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:20:53,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:20:53,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:20:53,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:20:53,918 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:20:53,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:20:53,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:20:53,918 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:20:53,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:20:53,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:20:53,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:20:53,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:20:53,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:20:53,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:20:53,919 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:20:53,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:20:53,919 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:20:53,919 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:20:53,919 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:20:53,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:20:53,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:20:53,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:20:53,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:20:53,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:20:53,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:20:53,920 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:20:53,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:20:53,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:20:53,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:20:53,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:20:53,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:20:53,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:20:53,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:20:53,921 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a1b99a13fe789fcacb85c536e70757eaddea3ef4c22e9aee449ecb3b551f3f3 [2025-03-08 16:20:54,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:20:54,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:20:54,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:20:54,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:20:54,167 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:20:54,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i [2025-03-08 16:20:55,304 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4c27d94/400e35101bc948c9955bf06a8bde3847/FLAG894da71c1 [2025-03-08 16:20:55,555 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:20:55,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i [2025-03-08 16:20:55,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4c27d94/400e35101bc948c9955bf06a8bde3847/FLAG894da71c1 [2025-03-08 16:20:55,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b4c27d94/400e35101bc948c9955bf06a8bde3847 [2025-03-08 16:20:55,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:20:55,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:20:55,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:20:55,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:20:55,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:20:55,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:20:55" (1/1) ... [2025-03-08 16:20:55,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13844875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:55, skipping insertion in model container [2025-03-08 16:20:55,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:20:55" (1/1) ... [2025-03-08 16:20:55,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:20:56,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i[916,929] [2025-03-08 16:20:56,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:20:56,068 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:20:56,075 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i[916,929] [2025-03-08 16:20:56,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:20:56,128 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:20:56,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:56 WrapperNode [2025-03-08 16:20:56,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:20:56,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:20:56,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:20:56,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:20:56,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:56" (1/1) ... [2025-03-08 16:20:56,146 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:56" (1/1) ... [2025-03-08 16:20:56,182 INFO L138 Inliner]: procedures = 29, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 541 [2025-03-08 16:20:56,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:20:56,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:20:56,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:20:56,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:20:56,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:56" (1/1) ... [2025-03-08 16:20:56,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:56" (1/1) ... [2025-03-08 16:20:56,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:56" (1/1) ... [2025-03-08 16:20:56,220 INFO L175 MemorySlicer]: Split 138 memory accesses to 7 slices as follows [2, 24, 67, 9, 30, 3, 3]. 49 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 4, 5, 1, 5, 1, 1]. The 18 writes are split as follows [0, 4, 6, 1, 5, 1, 1]. [2025-03-08 16:20:56,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:56" (1/1) ... [2025-03-08 16:20:56,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:56" (1/1) ... [2025-03-08 16:20:56,244 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:56" (1/1) ... [2025-03-08 16:20:56,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:56" (1/1) ... [2025-03-08 16:20:56,252 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:56" (1/1) ... [2025-03-08 16:20:56,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:56" (1/1) ... [2025-03-08 16:20:56,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:20:56,266 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:20:56,266 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:20:56,266 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:20:56,267 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:56" (1/1) ... [2025-03-08 16:20:56,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:20:56,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:20:56,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:20:56,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:20:56,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:20:56,314 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:20:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:20:56,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:20:56,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:20:56,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 16:20:56,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:20:56,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:20:56,419 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:20:56,420 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:20:56,782 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~mem101#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem102#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~short105#1;havoc property_#t~short107#1;havoc property_#t~mem110#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1;havoc property_#t~mem121#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite120#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem126#1;havoc property_#t~ite142#1;havoc property_#t~mem127#1;havoc property_#t~ite141#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem140#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~ite139#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~short143#1;havoc property_#t~mem145#1;havoc property_#t~mem144#1;havoc property_#t~short146#1;havoc property_#t~mem147#1;havoc property_#t~short148#1;havoc property_#t~mem149#1;havoc property_#t~short150#1; [2025-03-08 16:20:56,827 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2025-03-08 16:20:56,827 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:20:56,837 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:20:56,837 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:20:56,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:20:56 BoogieIcfgContainer [2025-03-08 16:20:56,838 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:20:56,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:20:56,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:20:56,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:20:56,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:20:55" (1/3) ... [2025-03-08 16:20:56,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53571f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:20:56, skipping insertion in model container [2025-03-08 16:20:56,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:20:56" (2/3) ... [2025-03-08 16:20:56,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53571f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:20:56, skipping insertion in model container [2025-03-08 16:20:56,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:20:56" (3/3) ... [2025-03-08 16:20:56,845 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-72.i [2025-03-08 16:20:56,855 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:20:56,856 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-72.i that has 2 procedures, 127 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:20:56,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:20:56,907 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;@7633d8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:20:56,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:20:56,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 107 states have (on average 1.411214953271028) internal successors, (151), 108 states have internal predecessors, (151), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:20:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 16:20:56,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:56,920 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:56,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:56,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:56,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1769762131, now seen corresponding path program 1 times [2025-03-08 16:20:56,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:56,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441209260] [2025-03-08 16:20:56,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:56,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:57,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:20:57,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:20:57,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:57,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:20:57,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:57,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441209260] [2025-03-08 16:20:57,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441209260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:20:57,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571859044] [2025-03-08 16:20:57,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:57,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:20:57,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:20:57,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:20:57,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:20:57,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:20:57,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:20:57,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:57,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:57,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:20:57,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:20:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:20:57,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:20:57,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571859044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:57,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:20:57,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:20:57,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808588259] [2025-03-08 16:20:57,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:57,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:20:57,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:57,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:20:57,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:20:57,464 INFO L87 Difference]: Start difference. First operand has 127 states, 107 states have (on average 1.411214953271028) internal successors, (151), 108 states have internal predecessors, (151), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:20:57,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:57,482 INFO L93 Difference]: Finished difference Result 248 states and 382 transitions. [2025-03-08 16:20:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:20:57,483 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 149 [2025-03-08 16:20:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:57,491 INFO L225 Difference]: With dead ends: 248 [2025-03-08 16:20:57,491 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 16:20:57,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:20:57,495 INFO L435 NwaCegarLoop]: 180 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, 180 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:57,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:20:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 16:20:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-08 16:20:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3904761904761904) internal successors, (146), 105 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:20:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 180 transitions. [2025-03-08 16:20:57,531 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 180 transitions. Word has length 149 [2025-03-08 16:20:57,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:57,533 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 180 transitions. [2025-03-08 16:20:57,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:20:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 180 transitions. [2025-03-08 16:20:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 16:20:57,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:57,537 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:57,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:20:57,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:20:57,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:57,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:57,740 INFO L85 PathProgramCache]: Analyzing trace with hash 976727590, now seen corresponding path program 1 times [2025-03-08 16:20:57,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:57,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314642247] [2025-03-08 16:20:57,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:57,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:57,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:20:57,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:20:57,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:57,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:20:58,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:58,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314642247] [2025-03-08 16:20:58,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314642247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:20:58,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995426704] [2025-03-08 16:20:58,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:58,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:20:58,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:20:58,112 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:20:58,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:20:58,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:20:58,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:20:58,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:58,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:58,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:20:58,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:20:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:20:58,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:20:58,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995426704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:58,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:20:58,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 16:20:58,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696223741] [2025-03-08 16:20:58,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:58,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:20:58,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:58,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:20:58,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:20:58,364 INFO L87 Difference]: Start difference. First operand 124 states and 180 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:20:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:58,407 INFO L93 Difference]: Finished difference Result 248 states and 361 transitions. [2025-03-08 16:20:58,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:20:58,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2025-03-08 16:20:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:58,409 INFO L225 Difference]: With dead ends: 248 [2025-03-08 16:20:58,409 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 16:20:58,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:20:58,410 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:58,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 520 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:20:58,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 16:20:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-03-08 16:20:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 107 states have internal predecessors, (148), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:20:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2025-03-08 16:20:58,423 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 149 [2025-03-08 16:20:58,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:58,425 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2025-03-08 16:20:58,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:20:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2025-03-08 16:20:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 16:20:58,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:58,429 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:58,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 16:20:58,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 16:20:58,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:58,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:58,631 INFO L85 PathProgramCache]: Analyzing trace with hash -830726873, now seen corresponding path program 1 times [2025-03-08 16:20:58,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:58,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433189133] [2025-03-08 16:20:58,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:58,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:58,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:20:58,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:20:58,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:58,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:20:58,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:58,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433189133] [2025-03-08 16:20:58,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433189133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:20:58,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87529879] [2025-03-08 16:20:58,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:58,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:20:58,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:20:58,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:20:58,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:20:58,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:20:59,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:20:59,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:59,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:59,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:20:59,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:20:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:20:59,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:20:59,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87529879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:59,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:20:59,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 16:20:59,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390261910] [2025-03-08 16:20:59,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:59,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:20:59,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:59,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:20:59,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:20:59,086 INFO L87 Difference]: Start difference. First operand 126 states and 182 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:20:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:59,119 INFO L93 Difference]: Finished difference Result 252 states and 365 transitions. [2025-03-08 16:20:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:20:59,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2025-03-08 16:20:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:59,123 INFO L225 Difference]: With dead ends: 252 [2025-03-08 16:20:59,123 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 16:20:59,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:20:59,126 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:59,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 521 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:20:59,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 16:20:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2025-03-08 16:20:59,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 109 states have internal predecessors, (150), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:20:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 184 transitions. [2025-03-08 16:20:59,139 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 184 transitions. Word has length 149 [2025-03-08 16:20:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:59,139 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 184 transitions. [2025-03-08 16:20:59,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:20:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 184 transitions. [2025-03-08 16:20:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 16:20:59,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:59,141 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:59,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 16:20:59,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:20:59,342 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:20:59,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:20:59,343 INFO L85 PathProgramCache]: Analyzing trace with hash 56776808, now seen corresponding path program 1 times [2025-03-08 16:20:59,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:20:59,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61308043] [2025-03-08 16:20:59,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:59,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:20:59,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:20:59,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:20:59,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:59,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:20:59,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:20:59,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61308043] [2025-03-08 16:20:59,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61308043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:20:59,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591468323] [2025-03-08 16:20:59,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:20:59,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:20:59,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:20:59,552 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:20:59,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:20:59,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:20:59,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:20:59,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:20:59,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:20:59,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:20:59,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:20:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:20:59,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:20:59,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591468323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:20:59,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:20:59,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 16:20:59,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430905041] [2025-03-08 16:20:59,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:20:59,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:20:59,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:20:59,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:20:59,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:20:59,796 INFO L87 Difference]: Start difference. First operand 128 states and 184 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:20:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:20:59,817 INFO L93 Difference]: Finished difference Result 256 states and 369 transitions. [2025-03-08 16:20:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:20:59,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2025-03-08 16:20:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:20:59,818 INFO L225 Difference]: With dead ends: 256 [2025-03-08 16:20:59,818 INFO L226 Difference]: Without dead ends: 131 [2025-03-08 16:20:59,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:20:59,819 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:20:59,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:20:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-08 16:20:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2025-03-08 16:20:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 111 states have (on average 1.3693693693693694) internal successors, (152), 111 states have internal predecessors, (152), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:20:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 186 transitions. [2025-03-08 16:20:59,826 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 186 transitions. Word has length 149 [2025-03-08 16:20:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:20:59,826 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 186 transitions. [2025-03-08 16:20:59,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:20:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 186 transitions. [2025-03-08 16:20:59,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 16:20:59,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:20:59,832 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:20:59,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 16:21:00,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:00,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:00,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:00,033 INFO L85 PathProgramCache]: Analyzing trace with hash 57700329, now seen corresponding path program 1 times [2025-03-08 16:21:00,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:00,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697226838] [2025-03-08 16:21:00,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:00,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:00,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:21:00,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:21:00,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:00,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:21:00,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:00,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697226838] [2025-03-08 16:21:00,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697226838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:21:00,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810574924] [2025-03-08 16:21:00,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:00,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:00,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:00,231 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:21:00,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 16:21:00,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:21:00,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:21:00,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:00,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:00,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:21:00,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:00,468 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:00,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810574924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:00,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:21:00,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-08 16:21:00,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280306347] [2025-03-08 16:21:00,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:00,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:21:00,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:00,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:21:00,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:21:00,470 INFO L87 Difference]: Start difference. First operand 130 states and 186 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:00,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:00,488 INFO L93 Difference]: Finished difference Result 259 states and 372 transitions. [2025-03-08 16:21:00,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:21:00,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2025-03-08 16:21:00,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:00,490 INFO L225 Difference]: With dead ends: 259 [2025-03-08 16:21:00,490 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 16:21:00,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:21:00,491 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:00,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:21:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 16:21:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-08 16:21:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:00,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2025-03-08 16:21:00,501 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 149 [2025-03-08 16:21:00,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:00,501 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2025-03-08 16:21:00,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2025-03-08 16:21:00,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:21:00,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:00,502 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:00,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 16:21:00,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:00,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:00,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:00,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1897313024, now seen corresponding path program 1 times [2025-03-08 16:21:00,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:00,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343578830] [2025-03-08 16:21:00,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:00,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:00,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:21:00,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:21:00,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:00,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:01,350 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:21:01,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:21:01,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343578830] [2025-03-08 16:21:01,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343578830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:21:01,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945043778] [2025-03-08 16:21:01,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:01,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:01,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:01,355 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:21:01,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 16:21:01,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:21:01,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:21:01,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:01,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:01,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 16:21:01,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:01,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:21:01,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:21:01,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 16:21:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 78 proven. 45 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2025-03-08 16:21:01,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:21:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:21:02,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945043778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:21:02,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:21:02,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2025-03-08 16:21:02,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319942719] [2025-03-08 16:21:02,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:21:02,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:21:02,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:21:02,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:21:02,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:21:02,125 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand has 12 states, 9 states have (on average 9.444444444444445) internal successors, (85), 12 states have internal predecessors, (85), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-08 16:21:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:02,411 INFO L93 Difference]: Finished difference Result 269 states and 380 transitions. [2025-03-08 16:21:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:21:02,411 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 9.444444444444445) internal successors, (85), 12 states have internal predecessors, (85), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) Word has length 151 [2025-03-08 16:21:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:02,412 INFO L225 Difference]: With dead ends: 269 [2025-03-08 16:21:02,412 INFO L226 Difference]: Without dead ends: 140 [2025-03-08 16:21:02,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 297 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:21:02,414 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 255 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:02,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 667 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:21:02,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-08 16:21:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2025-03-08 16:21:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 116 states have (on average 1.3448275862068966) internal successors, (156), 116 states have internal predecessors, (156), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 190 transitions. [2025-03-08 16:21:02,429 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 190 transitions. Word has length 151 [2025-03-08 16:21:02,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:02,429 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 190 transitions. [2025-03-08 16:21:02,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 9.444444444444445) internal successors, (85), 12 states have internal predecessors, (85), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-08 16:21:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 190 transitions. [2025-03-08 16:21:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:21:02,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:02,430 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:02,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 16:21:02,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:21:02,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:02,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:02,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1546513087, now seen corresponding path program 1 times [2025-03-08 16:21:02,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:21:02,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259624321] [2025-03-08 16:21:02,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:02,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:21:02,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:21:02,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:21:02,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:02,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:21:02,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:21:02,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:21:02,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:21:02,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:02,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:21:02,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:21:02,781 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:21:02,782 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:21:02,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:21:02,785 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:02,872 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:21:02,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:21:02 BoogieIcfgContainer [2025-03-08 16:21:02,874 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:21:02,875 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:21:02,875 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:21:02,875 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:21:02,875 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:20:56" (3/4) ... [2025-03-08 16:21:02,877 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:21:02,877 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:21:02,878 INFO L158 Benchmark]: Toolchain (without parser) took 6995.60ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 105.6MB in the beginning and 95.6MB in the end (delta: 10.0MB). Peak memory consumption was 150.4MB. Max. memory is 16.1GB. [2025-03-08 16:21:02,878 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:21:02,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.90ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 89.9MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:21:02,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.96ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 87.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:21:02,878 INFO L158 Benchmark]: Boogie Preprocessor took 78.67ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 82.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:21:02,878 INFO L158 Benchmark]: IcfgBuilder took 571.83ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 48.0MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:21:02,879 INFO L158 Benchmark]: TraceAbstraction took 6034.46ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 47.0MB in the beginning and 95.7MB in the end (delta: -48.6MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. [2025-03-08 16:21:02,879 INFO L158 Benchmark]: Witness Printer took 2.43ms. Allocated memory is still 285.2MB. Free memory was 95.7MB in the beginning and 95.6MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:21:02,880 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.84ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.90ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 89.9MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.96ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 87.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 78.67ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 82.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 571.83ms. Allocated memory is still 142.6MB. Free memory was 82.5MB in the beginning and 48.0MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6034.46ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 47.0MB in the beginning and 95.7MB in the end (delta: -48.6MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. * Witness Printer took 2.43ms. Allocated memory is still 285.2MB. Free memory was 95.7MB in the beginning and 95.6MB in the end (delta: 57.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 81, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 0}, {1, 1} }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L25-L27] double double_Array_0[5] = { 100000000000.4, 100000000000.2, 256.4, 50.5, 9.5 }; [L28-L30] float float_Array_0[1] = { 0.25 }; [L28-L30] float float_Array_0[1] = { 0.25 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L31-L33] signed char signed_char_Array_0[5] = { -2, -10, 4, -16, 4 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 2 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[1] = { 2 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 10000 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 10000 }; [L40] unsigned char last_1_BOOL_unsigned_char_Array_0_1__1_ = 1; [L41] double last_1_double_Array_0_2_ = 256.4; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L93] EXPR BOOL_unsigned_char_Array_0[1][1] [L93] last_1_BOOL_unsigned_char_Array_0_1__1_ = BOOL_unsigned_char_Array_0[1][1] [L94] EXPR double_Array_0[2] [L94] last_1_double_Array_0_2_ = double_Array_0[2] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L65] EXPR 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] EXPR 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L68] EXPR 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] EXPR 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L71] EXPR 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] double_Array_0[1] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[1] [L74] EXPR double_Array_0[1] >= 0.0F && 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L74] EXPR double_Array_0[1] [L74] EXPR double_Array_0[1] >= 0.0F && 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR (double_Array_0[1] >= 0.0F && 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR (double_Array_0[1] >= 0.0F && 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] double_Array_0[3] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[3] [L76] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L76] EXPR double_Array_0[3] [L76] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] double_Array_0[4] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[4] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F [L78] EXPR double_Array_0[4] [L78] EXPR double_Array_0[4] >= 0.0F && double_Array_0[4] <= -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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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((double_Array_0[4] >= 0.0F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] float_Array_0[0] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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((float_Array_0[0] >= -922337.2036854776000e+13F && 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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((float_Array_0[0] >= -922337.2036854776000e+13F && 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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(float_Array_0[0] != 0.0F) 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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(float_Array_0[0] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L83] EXPR signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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(signed_char_Array_0[0] >= -63) 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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(signed_char_Array_0[0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0] <= 63) 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L86] EXPR signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[1] >= -63) 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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(signed_char_Array_0[1] <= 63) 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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(signed_char_Array_0[1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] signed_char_Array_0[4] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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(signed_char_Array_0[4] >= 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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(signed_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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(signed_char_Array_0[4] <= 126) 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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(signed_char_Array_0[4] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] RET updateVariables() [L106] CALL step() [L45] 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0][0]) [L48] EXPR signed_char_Array_0[0] [L48] EXPR signed_char_Array_0[1] [L48] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] EXPR (((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4])) [L48] EXPR signed_char_Array_0[0] [L48] EXPR signed_char_Array_0[1] [L48] EXPR (((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] signed_char_Array_0[3] = (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4])))) [L49] EXPR double_Array_0[4] [L49] double_Array_0[0] = double_Array_0[4] [L50] signed_char_Array_0[2] = 1 [L51] unsigned_short_int_Array_0[0] = 10 [L52] EXPR double_Array_0[0] [L52] EXPR double_Array_0[0] [L52] EXPR float_Array_0[0] [L52] EXPR double_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] COND FALSE !((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) [L59] EXPR double_Array_0[0] [L59] EXPR double_Array_0[2] [L59] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] EXPR ((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]) [L59] EXPR double_Array_0[2] [L59] EXPR ((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] COND FALSE !(double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR double_Array_0[0] [L97] EXPR double_Array_0[2] [L97] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]) [L97] EXPR double_Array_0[2] [L97] EXPR ((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR double_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1 [L97] EXPR BOOL_unsigned_char_Array_0[1][1] [L97] EXPR BOOL_unsigned_char_Array_0[0][1] [L97] EXPR BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4]))) && (signed_char_Array_0[2] == ((signed char) 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR ((((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4]))) && (signed_char_Array_0[2] == ((signed char) 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4]))) && (signed_char_Array_0[2] == ((signed char) 1))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) 10)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] EXPR (((((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4]))) && (signed_char_Array_0[2] == ((signed char) 1))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) 10)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97-L98] return (((((((double_Array_0[0] < (((((double_Array_0[2]) < (double_Array_0[2])) ? (double_Array_0[2]) : (double_Array_0[2]))) * double_Array_0[2])) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && ((last_1_BOOL_unsigned_char_Array_0_1__1_ || BOOL_unsigned_char_Array_0[1][0]) && BOOL_unsigned_char_Array_0[0][0])))) : 1) && (BOOL_unsigned_char_Array_0[0][0] ? (unsigned_long_int_Array_0[0] == ((unsigned long int) 2u)) : 1)) && (signed_char_Array_0[3] == ((signed char) (((((signed_char_Array_0[0] + signed_char_Array_0[1])) < ((10 - signed_char_Array_0[4]))) ? ((signed_char_Array_0[0] + signed_char_Array_0[1])) : ((10 - signed_char_Array_0[4]))))))) && (((double_Array_0[0] + (double_Array_0[0] / float_Array_0[0])) == double_Array_0[0]) ? ((double_Array_0[0] >= last_1_double_Array_0_2_) ? (double_Array_0[2] == ((double) (double_Array_0[1] - (((((double_Array_0[3] + double_Array_0[4])) < (9.9999999999995E12)) ? ((double_Array_0[3] + double_Array_0[4])) : (9.9999999999995E12)))))) : (double_Array_0[2] == ((double) ((((double_Array_0[1]) < ((5.75 + double_Array_0[4]))) ? (double_Array_0[1]) : ((5.75 + double_Array_0[4]))))))) : 1)) && (double_Array_0[0] == ((double) double_Array_0[4]))) && (signed_char_Array_0[2] == ((signed char) 1))) && (unsigned_short_int_Array_0[0] == ((unsigned short int) 10)) ; [L107] RET, EXPR property() [L107] 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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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_BOOL_unsigned_char_Array_0_1__1_=1, last_1_double_Array_0_2_=1282/5, signed_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, 127 locations, 202 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 7, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 2934 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1901 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 312 IncrementalHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 1033 mSDtfsCounter, 312 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1092 GetRequests, 1044 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=6, InterpolantAutomatonStates: 31, 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, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1943 NumberOfCodeBlocks, 1943 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1930 ConstructedInterpolants, 0 QuantifiedInterpolants, 3636 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3203 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 6713/7072 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 16:21:02,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a1b99a13fe789fcacb85c536e70757eaddea3ef4c22e9aee449ecb3b551f3f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:21:04,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:21:04,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:21:04,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:21:04,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:21:04,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:21:04,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:21:04,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:21:04,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:21:04,894 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:21:04,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:21:04,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:21:04,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:21:04,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:21:04,896 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:21:04,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:21:04,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:21:04,896 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:21:04,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:21:04,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:21:04,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:21:04,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:21:04,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:21:04,897 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:21:04,897 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:21:04,897 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:21:04,897 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:21:04,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:21:04,897 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:21:04,897 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:21:04,897 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:21:04,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:21:04,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:21:04,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:21:04,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:21:04,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:21:04,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:21:04,898 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:21:04,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:21:04,898 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:21:04,898 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:21:04,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:21:04,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:21:04,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:21:04,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:21:04,898 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a1b99a13fe789fcacb85c536e70757eaddea3ef4c22e9aee449ecb3b551f3f3 [2025-03-08 16:21:05,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:21:05,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:21:05,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:21:05,156 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:21:05,156 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:21:05,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i [2025-03-08 16:21:06,335 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca485f75/fb796960e8fc431f910a463a8131cd40/FLAG1bf5734dc [2025-03-08 16:21:06,529 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:21:06,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i [2025-03-08 16:21:06,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca485f75/fb796960e8fc431f910a463a8131cd40/FLAG1bf5734dc [2025-03-08 16:21:06,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca485f75/fb796960e8fc431f910a463a8131cd40 [2025-03-08 16:21:06,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:21:06,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:21:06,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:21:06,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:21:06,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:21:06,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:21:06" (1/1) ... [2025-03-08 16:21:06,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a21801a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:06, skipping insertion in model container [2025-03-08 16:21:06,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:21:06" (1/1) ... [2025-03-08 16:21:06,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:21:06,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i[916,929] [2025-03-08 16:21:06,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:21:06,753 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:21:06,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-72.i[916,929] [2025-03-08 16:21:06,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:21:06,819 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:21:06,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:06 WrapperNode [2025-03-08 16:21:06,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:21:06,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:21:06,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:21:06,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:21:06,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:06" (1/1) ... [2025-03-08 16:21:06,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:06" (1/1) ... [2025-03-08 16:21:06,884 INFO L138 Inliner]: procedures = 39, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 538 [2025-03-08 16:21:06,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:21:06,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:21:06,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:21:06,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:21:06,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:06" (1/1) ... [2025-03-08 16:21:06,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:06" (1/1) ... [2025-03-08 16:21:06,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:06" (1/1) ... [2025-03-08 16:21:06,941 INFO L175 MemorySlicer]: Split 138 memory accesses to 7 slices as follows [2, 24, 67, 9, 30, 3, 3]. 49 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 4, 5, 1, 5, 1, 1]. The 18 writes are split as follows [0, 4, 6, 1, 5, 1, 1]. [2025-03-08 16:21:06,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:06" (1/1) ... [2025-03-08 16:21:06,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:06" (1/1) ... [2025-03-08 16:21:06,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:06" (1/1) ... [2025-03-08 16:21:06,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:06" (1/1) ... [2025-03-08 16:21:06,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:06" (1/1) ... [2025-03-08 16:21:06,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:06" (1/1) ... [2025-03-08 16:21:06,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:21:06,997 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:21:06,997 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:21:06,998 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:21:07,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:06" (1/1) ... [2025-03-08 16:21:07,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:21:07,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:21:07,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:21:07,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:21:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:21:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 16:21:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 16:21:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-08 16:21:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-08 16:21:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-08 16:21:07,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-08 16:21:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-08 16:21:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 16:21:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 16:21:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-08 16:21:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-08 16:21:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-08 16:21:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-08 16:21:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-08 16:21:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:21:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:21:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 16:21:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-08 16:21:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-08 16:21:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-08 16:21:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-08 16:21:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-08 16:21:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-08 16:21:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-08 16:21:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-08 16:21:07,059 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:21:07,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:21:07,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-08 16:21:07,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-08 16:21:07,217 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:21:07,219 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:21:35,520 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~mem101#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem100#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem102#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~short105#1;havoc property_#t~short107#1;havoc property_#t~mem110#1;havoc property_#t~ite112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1;havoc property_#t~mem121#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite120#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem126#1;havoc property_#t~ite142#1;havoc property_#t~mem127#1;havoc property_#t~ite141#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem140#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~ite139#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~short143#1;havoc property_#t~mem145#1;havoc property_#t~mem144#1;havoc property_#t~short146#1;havoc property_#t~mem147#1;havoc property_#t~short148#1;havoc property_#t~mem149#1;havoc property_#t~short150#1; [2025-03-08 16:21:35,544 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2025-03-08 16:21:35,544 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:21:35,551 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:21:35,552 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:21:35,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:21:35 BoogieIcfgContainer [2025-03-08 16:21:35,552 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:21:35,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:21:35,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:21:35,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:21:35,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:21:06" (1/3) ... [2025-03-08 16:21:35,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cb0d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:21:35, skipping insertion in model container [2025-03-08 16:21:35,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:21:06" (2/3) ... [2025-03-08 16:21:35,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cb0d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:21:35, skipping insertion in model container [2025-03-08 16:21:35,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:21:35" (3/3) ... [2025-03-08 16:21:35,559 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-72.i [2025-03-08 16:21:35,569 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:21:35,571 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-72.i that has 2 procedures, 127 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:21:35,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:21:35,623 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;@74bb52b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:21:35,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:21:35,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 107 states have (on average 1.411214953271028) internal successors, (151), 108 states have internal predecessors, (151), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:35,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 16:21:35,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:35,637 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:35,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:35,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:35,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1769762131, now seen corresponding path program 1 times [2025-03-08 16:21:35,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:21:35,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956195661] [2025-03-08 16:21:35,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:35,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:35,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:21:35,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:21:35,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 16:21:35,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:21:36,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:21:36,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:36,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:36,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:21:36,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 16:21:36,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:36,924 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:21:36,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956195661] [2025-03-08 16:21:36,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956195661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:36,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:36,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:21:36,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205556093] [2025-03-08 16:21:36,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:36,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:21:36,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:21:36,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:21:36,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:21:36,950 INFO L87 Difference]: Start difference. First operand has 127 states, 107 states have (on average 1.411214953271028) internal successors, (151), 108 states have internal predecessors, (151), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:21:36,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:36,972 INFO L93 Difference]: Finished difference Result 248 states and 382 transitions. [2025-03-08 16:21:36,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:21:36,974 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 149 [2025-03-08 16:21:36,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:36,978 INFO L225 Difference]: With dead ends: 248 [2025-03-08 16:21:36,978 INFO L226 Difference]: Without dead ends: 124 [2025-03-08 16:21:36,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:21:36,982 INFO L435 NwaCegarLoop]: 180 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, 180 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:36,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:21:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-08 16:21:37,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-08 16:21:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.3904761904761904) internal successors, (146), 105 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 180 transitions. [2025-03-08 16:21:37,010 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 180 transitions. Word has length 149 [2025-03-08 16:21:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:37,010 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 180 transitions. [2025-03-08 16:21:37,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:21:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 180 transitions. [2025-03-08 16:21:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 16:21:37,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:37,014 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:37,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 16:21:37,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:37,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:37,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:37,220 INFO L85 PathProgramCache]: Analyzing trace with hash 976727590, now seen corresponding path program 1 times [2025-03-08 16:21:37,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:21:37,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674341332] [2025-03-08 16:21:37,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:37,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:37,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:21:37,222 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:21:37,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 16:21:37,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:21:38,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:21:38,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:38,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:38,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:21:38,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:38,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:38,583 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:21:38,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674341332] [2025-03-08 16:21:38,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674341332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:38,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:38,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:21:38,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782447835] [2025-03-08 16:21:38,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:38,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:21:38,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:21:38,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:21:38,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:21:38,587 INFO L87 Difference]: Start difference. First operand 124 states and 180 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:38,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:38,788 INFO L93 Difference]: Finished difference Result 247 states and 360 transitions. [2025-03-08 16:21:38,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:21:38,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 149 [2025-03-08 16:21:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:38,790 INFO L225 Difference]: With dead ends: 247 [2025-03-08 16:21:38,790 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 16:21:38,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:21:38,791 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:38,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:21:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 16:21:38,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-08 16:21:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.3831775700934579) internal successors, (148), 107 states have internal predecessors, (148), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2025-03-08 16:21:38,800 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 149 [2025-03-08 16:21:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:38,802 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2025-03-08 16:21:38,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2025-03-08 16:21:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:21:38,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:38,804 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:38,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 16:21:39,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:39,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:39,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:39,005 INFO L85 PathProgramCache]: Analyzing trace with hash -978285763, now seen corresponding path program 1 times [2025-03-08 16:21:39,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:21:39,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501194097] [2025-03-08 16:21:39,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:39,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:39,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:21:39,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:21:39,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 16:21:39,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:21:40,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:21:40,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:40,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:40,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:21:40,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:40,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:40,521 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:21:40,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501194097] [2025-03-08 16:21:40,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501194097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:40,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:40,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:21:40,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707056797] [2025-03-08 16:21:40,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:40,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:21:40,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:21:40,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:21:40,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:21:40,522 INFO L87 Difference]: Start difference. First operand 126 states and 182 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:41,037 INFO L93 Difference]: Finished difference Result 256 states and 371 transitions. [2025-03-08 16:21:41,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:21:41,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2025-03-08 16:21:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:41,039 INFO L225 Difference]: With dead ends: 256 [2025-03-08 16:21:41,039 INFO L226 Difference]: Without dead ends: 133 [2025-03-08 16:21:41,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:21:41,041 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 1 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:41,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 844 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:21:41,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-08 16:21:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2025-03-08 16:21:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 113 states have internal predecessors, (154), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:41,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 188 transitions. [2025-03-08 16:21:41,047 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 188 transitions. Word has length 151 [2025-03-08 16:21:41,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:41,049 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 188 transitions. [2025-03-08 16:21:41,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 188 transitions. [2025-03-08 16:21:41,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:21:41,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:41,050 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:41,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 16:21:41,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:41,251 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:41,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:41,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1509227070, now seen corresponding path program 1 times [2025-03-08 16:21:41,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:21:41,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011340503] [2025-03-08 16:21:41,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:41,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:41,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:21:41,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:21:41,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 16:21:41,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:21:42,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:21:42,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:42,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:42,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:21:42,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:42,926 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:42,926 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:42,926 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:21:42,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011340503] [2025-03-08 16:21:42,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011340503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:42,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:42,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:21:42,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71888367] [2025-03-08 16:21:42,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:42,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:21:42,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:21:42,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:21:42,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:21:42,931 INFO L87 Difference]: Start difference. First operand 132 states and 188 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:43,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:43,629 INFO L93 Difference]: Finished difference Result 264 states and 377 transitions. [2025-03-08 16:21:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:21:43,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2025-03-08 16:21:43,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:43,630 INFO L225 Difference]: With dead ends: 264 [2025-03-08 16:21:43,631 INFO L226 Difference]: Without dead ends: 135 [2025-03-08 16:21:43,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:21:43,631 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:43,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1001 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:21:43,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-08 16:21:43,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2025-03-08 16:21:43,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 115 states have (on average 1.3565217391304347) internal successors, (156), 115 states have internal predecessors, (156), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 190 transitions. [2025-03-08 16:21:43,643 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 190 transitions. Word has length 151 [2025-03-08 16:21:43,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:43,643 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 190 transitions. [2025-03-08 16:21:43,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 190 transitions. [2025-03-08 16:21:43,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:21:43,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:43,646 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:43,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 16:21:43,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:43,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:43,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1898236545, now seen corresponding path program 1 times [2025-03-08 16:21:43,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:21:43,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162217536] [2025-03-08 16:21:43,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:43,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:43,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:21:43,850 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:21:43,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 16:21:43,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:21:44,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:21:44,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:44,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:44,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 16:21:44,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:21:45,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:45,637 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:21:45,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162217536] [2025-03-08 16:21:45,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162217536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:45,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:45,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:21:45,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116151763] [2025-03-08 16:21:45,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:45,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:21:45,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:21:45,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:21:45,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:21:45,638 INFO L87 Difference]: Start difference. First operand 134 states and 190 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:21:46,549 INFO L93 Difference]: Finished difference Result 268 states and 381 transitions. [2025-03-08 16:21:46,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:21:46,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 151 [2025-03-08 16:21:46,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:21:46,550 INFO L225 Difference]: With dead ends: 268 [2025-03-08 16:21:46,550 INFO L226 Difference]: Without dead ends: 137 [2025-03-08 16:21:46,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:21:46,551 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:21:46,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1160 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:21:46,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-08 16:21:46,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2025-03-08 16:21:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 117 states have internal predecessors, (158), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:21:46,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 192 transitions. [2025-03-08 16:21:46,561 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 192 transitions. Word has length 151 [2025-03-08 16:21:46,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:21:46,562 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 192 transitions. [2025-03-08 16:21:46,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:21:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 192 transitions. [2025-03-08 16:21:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:21:46,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:21:46,566 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:21:46,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-08 16:21:46,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:46,767 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:21:46,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:21:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1897313024, now seen corresponding path program 1 times [2025-03-08 16:21:46,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:21:46,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624013105] [2025-03-08 16:21:46,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:21:46,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:21:46,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:21:46,770 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:21:46,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 16:21:46,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:21:47,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:21:47,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:21:47,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:21:47,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:21:47,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:21:48,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:21:48,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-08 16:21:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-08 16:21:49,191 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:21:49,191 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:21:49,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624013105] [2025-03-08 16:21:49,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624013105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:21:49,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:21:49,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:21:49,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925074304] [2025-03-08 16:21:49,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:21:49,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:21:49,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:21:49,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:21:49,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:21:49,193 INFO L87 Difference]: Start difference. First operand 136 states and 192 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:21:54,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:21:58,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:02,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:04,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:09,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:13,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:17,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:21,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:27,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:29,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:31,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:22:35,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []