./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-29.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7afbca337d6b0e7d1ba52e268e8d9f04cbe46de837efea70a60034ae30c81b9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:32:14,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:32:14,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:32:14,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:32:14,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:32:14,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:32:14,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:32:14,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:32:14,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:32:14,597 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:32:14,597 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:32:14,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:32:14,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:32:14,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:32:14,597 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:32:14,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:32:14,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:32:14,597 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:32:14,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:32:14,598 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:32:14,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:32:14,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:32:14,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:32:14,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:32:14,599 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:32:14,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:32:14,599 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:32:14,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:32:14,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:32:14,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:32:14,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:32:14,599 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:32:14,599 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7afbca337d6b0e7d1ba52e268e8d9f04cbe46de837efea70a60034ae30c81b9e [2025-01-09 15:32:14,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:32:14,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:32:14,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:32:14,780 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:32:14,780 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:32:14,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-29.i [2025-01-09 15:32:15,850 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb526980d/46921067bf154db488d97e0a357c7854/FLAGdd8bd3097 [2025-01-09 15:32:16,089 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:32:16,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-29.i [2025-01-09 15:32:16,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb526980d/46921067bf154db488d97e0a357c7854/FLAGdd8bd3097 [2025-01-09 15:32:16,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb526980d/46921067bf154db488d97e0a357c7854 [2025-01-09 15:32:16,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:32:16,440 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:32:16,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:32:16,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:32:16,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:32:16,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:32:16" (1/1) ... [2025-01-09 15:32:16,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47167c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16, skipping insertion in model container [2025-01-09 15:32:16,451 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:32:16" (1/1) ... [2025-01-09 15:32:16,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:32:16,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-29.i[917,930] [2025-01-09 15:32:16,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:32:16,619 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:32:16,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-29.i[917,930] [2025-01-09 15:32:16,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:32:16,658 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:32:16,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16 WrapperNode [2025-01-09 15:32:16,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:32:16,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:32:16,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:32:16,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:32:16,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16" (1/1) ... [2025-01-09 15:32:16,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16" (1/1) ... [2025-01-09 15:32:16,689 INFO L138 Inliner]: procedures = 29, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 429 [2025-01-09 15:32:16,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:32:16,690 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:32:16,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:32:16,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:32:16,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16" (1/1) ... [2025-01-09 15:32:16,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16" (1/1) ... [2025-01-09 15:32:16,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16" (1/1) ... [2025-01-09 15:32:16,726 INFO L175 MemorySlicer]: Split 108 memory accesses to 5 slices as follows [2, 11, 53, 34, 8]. 49 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 3, 3, 2]. The 12 writes are split as follows [0, 2, 4, 3, 3]. [2025-01-09 15:32:16,727 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16" (1/1) ... [2025-01-09 15:32:16,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16" (1/1) ... [2025-01-09 15:32:16,735 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16" (1/1) ... [2025-01-09 15:32:16,736 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16" (1/1) ... [2025-01-09 15:32:16,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16" (1/1) ... [2025-01-09 15:32:16,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16" (1/1) ... [2025-01-09 15:32:16,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16" (1/1) ... [2025-01-09 15:32:16,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:32:16,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:32:16,750 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:32:16,750 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:32:16,751 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16" (1/1) ... [2025-01-09 15:32:16,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:32:16,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:32:16,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:32:16,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:32:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:32:16,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:32:16,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:32:16,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:32:16,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:32:16,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:32:16,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:32:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:32:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:32:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:32:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:32:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:32:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:32:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:32:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:32:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:32:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:32:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:32:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:32:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:32:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:32:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:32:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:32:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:32:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:32:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:32:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:32:16,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:32:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:32:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:32:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:32:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:32:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:32:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:32:16,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:32:16,903 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:32:16,905 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:32:17,228 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-01-09 15:32:17,229 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:32:17,238 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:32:17,239 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:32:17,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:32:17 BoogieIcfgContainer [2025-01-09 15:32:17,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:32:17,241 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:32:17,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:32:17,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:32:17,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:32:16" (1/3) ... [2025-01-09 15:32:17,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d790b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:32:17, skipping insertion in model container [2025-01-09 15:32:17,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:16" (2/3) ... [2025-01-09 15:32:17,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d790b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:32:17, skipping insertion in model container [2025-01-09 15:32:17,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:32:17" (3/3) ... [2025-01-09 15:32:17,247 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-29.i [2025-01-09 15:32:17,260 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:32:17,262 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-29.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:32:17,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:32:17,306 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;@1de0bd12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:32:17,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:32:17,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 79 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 15:32:17,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 15:32:17,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:17,317 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:17,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:17,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1495711474, now seen corresponding path program 1 times [2025-01-09 15:32:17,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:32:17,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587925555] [2025-01-09 15:32:17,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:17,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:32:17,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 15:32:17,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 15:32:17,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:17,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 15:32:17,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:32:17,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587925555] [2025-01-09 15:32:17,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587925555] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:32:17,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381303650] [2025-01-09 15:32:17,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:17,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:32:17,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:32:17,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:32:17,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:32:17,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 15:32:17,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 15:32:17,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:17,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:17,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:32:17,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 15:32:17,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:32:17,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381303650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:32:17,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:32:17,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:32:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757337705] [2025-01-09 15:32:17,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:17,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:32:17,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:32:17,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:32:17,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:32:17,723 INFO L87 Difference]: Start difference. First operand has 87 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 79 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 15:32:17,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:17,744 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2025-01-09 15:32:17,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:32:17,745 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-01-09 15:32:17,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:17,748 INFO L225 Difference]: With dead ends: 168 [2025-01-09 15:32:17,749 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 15:32:17,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:32:17,752 INFO L435 NwaCegarLoop]: 120 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, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:17,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:32:17,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 15:32:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 15:32:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 15:32:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-01-09 15:32:17,773 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 73 [2025-01-09 15:32:17,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:17,774 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-01-09 15:32:17,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 15:32:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-01-09 15:32:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 15:32:17,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:17,779 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:17,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:32:17,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:32:17,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:17,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:17,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1186606166, now seen corresponding path program 1 times [2025-01-09 15:32:17,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:32:17,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805048908] [2025-01-09 15:32:17,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:32:18,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 15:32:18,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 15:32:18,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:18,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:18,208 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 15:32:18,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:32:18,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805048908] [2025-01-09 15:32:18,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805048908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:32:18,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:32:18,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:32:18,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239655280] [2025-01-09 15:32:18,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:18,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:32:18,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:32:18,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:32:18,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:32:18,209 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 15:32:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:18,245 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2025-01-09 15:32:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:32:18,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-01-09 15:32:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:18,246 INFO L225 Difference]: With dead ends: 167 [2025-01-09 15:32:18,246 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 15:32:18,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:32:18,247 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 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-01-09 15:32:18,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:32:18,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 15:32:18,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-01-09 15:32:18,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 15:32:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2025-01-09 15:32:18,259 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 73 [2025-01-09 15:32:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:18,260 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2025-01-09 15:32:18,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 15:32:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2025-01-09 15:32:18,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 15:32:18,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:18,262 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:18,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:32:18,262 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:18,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:18,263 INFO L85 PathProgramCache]: Analyzing trace with hash -833517784, now seen corresponding path program 1 times [2025-01-09 15:32:18,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:32:18,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595937219] [2025-01-09 15:32:18,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:18,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:32:18,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 15:32:18,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 15:32:18,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:18,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 15:32:18,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:32:18,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595937219] [2025-01-09 15:32:18,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595937219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:32:18,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:32:18,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:32:18,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66706785] [2025-01-09 15:32:18,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:18,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:32:18,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:32:18,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:32:18,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:32:18,378 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 15:32:18,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:18,402 INFO L93 Difference]: Finished difference Result 172 states and 245 transitions. [2025-01-09 15:32:18,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:32:18,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-01-09 15:32:18,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:18,403 INFO L225 Difference]: With dead ends: 172 [2025-01-09 15:32:18,403 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 15:32:18,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:32:18,404 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 340 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-01-09 15:32:18,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 340 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:32:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 15:32:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2025-01-09 15:32:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 15:32:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2025-01-09 15:32:18,409 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 73 [2025-01-09 15:32:18,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:18,409 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2025-01-09 15:32:18,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 15:32:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2025-01-09 15:32:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 15:32:18,410 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:18,410 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:18,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:32:18,410 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:18,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:18,411 INFO L85 PathProgramCache]: Analyzing trace with hash 941489578, now seen corresponding path program 1 times [2025-01-09 15:32:18,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:32:18,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377133662] [2025-01-09 15:32:18,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:18,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:32:18,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 15:32:18,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 15:32:18,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:18,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:32:18,468 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:32:18,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 15:32:18,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 15:32:18,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:18,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:32:18,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:32:18,590 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:32:18,591 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:32:18,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:32:18,595 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 15:32:18,716 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:32:18,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:32:18 BoogieIcfgContainer [2025-01-09 15:32:18,720 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:32:18,721 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:32:18,721 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:32:18,721 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:32:18,722 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:32:17" (3/4) ... [2025-01-09 15:32:18,723 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:32:18,725 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:32:18,725 INFO L158 Benchmark]: Toolchain (without parser) took 2285.12ms. Allocated memory is still 201.3MB. Free memory was 158.9MB in the beginning and 167.0MB in the end (delta: -8.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:32:18,726 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 209.7MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:32:18,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.57ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 144.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:32:18,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.84ms. Allocated memory is still 201.3MB. Free memory was 144.8MB in the beginning and 141.6MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:32:18,727 INFO L158 Benchmark]: Boogie Preprocessor took 59.70ms. Allocated memory is still 201.3MB. Free memory was 141.6MB in the beginning and 137.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:32:18,727 INFO L158 Benchmark]: RCFGBuilder took 489.14ms. Allocated memory is still 201.3MB. Free memory was 137.9MB in the beginning and 108.3MB in the end (delta: 29.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:32:18,728 INFO L158 Benchmark]: TraceAbstraction took 1478.93ms. Allocated memory is still 201.3MB. Free memory was 107.6MB in the beginning and 167.0MB in the end (delta: -59.4MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2025-01-09 15:32:18,728 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 201.3MB. Free memory was 167.0MB in the beginning and 167.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:32:18,729 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 209.7MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.57ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 144.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.84ms. Allocated memory is still 201.3MB. Free memory was 144.8MB in the beginning and 141.6MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.70ms. Allocated memory is still 201.3MB. Free memory was 141.6MB in the beginning and 137.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 489.14ms. Allocated memory is still 201.3MB. Free memory was 137.9MB in the beginning and 108.3MB in the end (delta: 29.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1478.93ms. Allocated memory is still 201.3MB. Free memory was 107.6MB in the beginning and 167.0MB in the end (delta: -59.4MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 201.3MB. Free memory was 167.0MB in the beginning and 167.0MB in the end (delta: 33.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 80, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 56. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27-L29] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L27-L29] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L27-L29] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L27-L29] float float_Array_0[3] = { 3.4, 9.3, 2.5 }; [L30] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L31] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L32] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[2]); [L33-L35] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L33-L35] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L33-L35] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L33-L35] unsigned char unsigned_char_Array_0[3] = { 8, 5, 8 }; [L36] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L37] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L38] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[2]); [L39-L41] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L39-L41] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L39-L41] unsigned short int unsigned_short_int_Array_0[2] = { 1, 32 }; [L42] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer = &(unsigned_short_int_Array_0[0]); [L43] unsigned short int* unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer = &(unsigned_short_int_Array_0[1]); VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=0, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L92] isInitial = 1 [L93] FCALL initially() [L95] FCALL updateLastVariables() [L96] CALL updateVariables() [L74] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L76] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L77] float_Array_0[0] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[0] [L78] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L78] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L78] EXPR float_Array_0[0] [L78] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L78] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L78] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L78] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L78] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L79] float_Array_0[1] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[1] [L80] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L80] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L80] EXPR float_Array_0[1] [L80] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L80] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L80] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L80] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L80] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L81] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L83] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L96] RET updateVariables() [L97] CALL step() [L47] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer) [L47] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L48] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L48] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) [L49] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L49] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) [L50] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L50] (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) [L56] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L56] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L56] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L56] COND FALSE !(((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) [L59] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L59] (*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L61] signed long int stepLocal_0 = 5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)); [L62] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L62] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L62] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) [L62] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L62] EXPR (((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, stepLocal_0=1270, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L62] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L62] COND FALSE !((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) [L69] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L69] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L69] COND TRUE (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) [L70] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L70] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) [L97] RET step() [L98] CALL, EXPR property() [L88] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) [L88] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar2_Pointer) [L88] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar1_Pointer) [L88] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR ((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR (((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88] EXPR ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L88-L89] return ((((((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) : ((! ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))))))) : 1)) && ((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + 8.125) > ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)))) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer))))))) : ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))))) && (((((((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))))) == (*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (5 * (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) ? (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) * 256.5f)) ? ((*(unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer)) == ((unsigned short int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)))) : 1) : 1) : 1)) && (((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) < (*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : 1)) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))))) && ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, isInitial=1, unsigned_char_Array_0={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={6:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={6:2}, unsigned_short_int_Array_0={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var0_Pointer={7:0}, unsigned_short_int_Array_0_arrayunsigned_short_int_Array_0Var1_Pointer={7:2}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 803 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 448 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 355 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 365 NumberOfCodeBlocks, 365 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 230/240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:32:18,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-29.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7afbca337d6b0e7d1ba52e268e8d9f04cbe46de837efea70a60034ae30c81b9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:32:20,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:32:20,631 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:32:20,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:32:20,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:32:20,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:32:20,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:32:20,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:32:20,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:32:20,650 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:32:20,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:32:20,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:32:20,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:32:20,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:32:20,651 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:32:20,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:32:20,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:32:20,651 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:32:20,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:32:20,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:32:20,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:32:20,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:32:20,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:32:20,651 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:32:20,651 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:32:20,651 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:32:20,651 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:32:20,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:32:20,651 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:32:20,652 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:32:20,652 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:32:20,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:32:20,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:32:20,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:32:20,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:32:20,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:32:20,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:32:20,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:32:20,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:32:20,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:32:20,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:32:20,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:32:20,652 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:32:20,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:32:20,652 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:32:20,652 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:32:20,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:32:20,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:32:20,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:32:20,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:32:20,653 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7afbca337d6b0e7d1ba52e268e8d9f04cbe46de837efea70a60034ae30c81b9e [2025-01-09 15:32:20,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:32:20,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:32:20,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:32:20,943 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:32:20,944 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:32:20,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-29.i [2025-01-09 15:32:22,153 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56094a7e8/d8caf19d815c43b9a9cf73bceea49e5f/FLAG8b44955cf [2025-01-09 15:32:22,370 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:32:22,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-29.i [2025-01-09 15:32:22,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56094a7e8/d8caf19d815c43b9a9cf73bceea49e5f/FLAG8b44955cf [2025-01-09 15:32:22,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56094a7e8/d8caf19d815c43b9a9cf73bceea49e5f [2025-01-09 15:32:22,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:32:22,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:32:22,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:32:22,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:32:22,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:32:22,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:32:22" (1/1) ... [2025-01-09 15:32:22,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5354ba93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22, skipping insertion in model container [2025-01-09 15:32:22,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:32:22" (1/1) ... [2025-01-09 15:32:22,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:32:22,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-29.i[917,930] [2025-01-09 15:32:22,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:32:22,625 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:32:22,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-29.i[917,930] [2025-01-09 15:32:22,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:32:22,688 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:32:22,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22 WrapperNode [2025-01-09 15:32:22,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:32:22,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:32:22,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:32:22,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:32:22,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22" (1/1) ... [2025-01-09 15:32:22,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22" (1/1) ... [2025-01-09 15:32:22,739 INFO L138 Inliner]: procedures = 33, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 429 [2025-01-09 15:32:22,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:32:22,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:32:22,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:32:22,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:32:22,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22" (1/1) ... [2025-01-09 15:32:22,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22" (1/1) ... [2025-01-09 15:32:22,756 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22" (1/1) ... [2025-01-09 15:32:22,779 INFO L175 MemorySlicer]: Split 108 memory accesses to 5 slices as follows [2, 11, 53, 34, 8]. 49 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 2, 3, 3, 2]. The 12 writes are split as follows [0, 2, 4, 3, 3]. [2025-01-09 15:32:22,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22" (1/1) ... [2025-01-09 15:32:22,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22" (1/1) ... [2025-01-09 15:32:22,797 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22" (1/1) ... [2025-01-09 15:32:22,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22" (1/1) ... [2025-01-09 15:32:22,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22" (1/1) ... [2025-01-09 15:32:22,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22" (1/1) ... [2025-01-09 15:32:22,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22" (1/1) ... [2025-01-09 15:32:22,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:32:22,825 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:32:22,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:32:22,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:32:22,829 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22" (1/1) ... [2025-01-09 15:32:22,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:32:22,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:32:22,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:32:22,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:32:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:32:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:32:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:32:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:32:22,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:32:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:32:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:32:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:32:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:32:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:32:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:32:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:32:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:32:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:32:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:32:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:32:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:32:22,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:32:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:32:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:32:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:32:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:32:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:32:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:32:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:32:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:32:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:32:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:32:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:32:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:32:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:32:22,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:32:22,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:32:22,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:32:22,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:32:22,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:32:22,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:32:22,886 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:32:22,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:32:22,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:32:22,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:32:22,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:32:22,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:32:22,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:32:22,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:32:22,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:32:22,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:32:22,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:32:22,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:32:22,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:32:23,035 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:32:23,037 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:32:31,351 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-01-09 15:32:31,351 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:32:31,361 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:32:31,362 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:32:31,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:32:31 BoogieIcfgContainer [2025-01-09 15:32:31,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:32:31,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:32:31,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:32:31,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:32:31,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:32:22" (1/3) ... [2025-01-09 15:32:31,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c370a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:32:31, skipping insertion in model container [2025-01-09 15:32:31,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:32:22" (2/3) ... [2025-01-09 15:32:31,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c370a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:32:31, skipping insertion in model container [2025-01-09 15:32:31,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:32:31" (3/3) ... [2025-01-09 15:32:31,368 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-29.i [2025-01-09 15:32:31,377 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:32:31,378 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-29.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:32:31,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:32:31,431 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;@7d0b375, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:32:31,434 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:32:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 79 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 15:32:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 15:32:31,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:31,443 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:31,443 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:31,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:31,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1495711474, now seen corresponding path program 1 times [2025-01-09 15:32:31,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:31,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846209227] [2025-01-09 15:32:31,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:31,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:31,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:31,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:31,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:32:31,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 15:32:31,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 15:32:31,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:31,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:31,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:32:31,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 15:32:31,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:32:31,866 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:31,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846209227] [2025-01-09 15:32:31,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846209227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:32:31,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:32:31,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:32:31,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121541693] [2025-01-09 15:32:31,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:31,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:32:31,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:31,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:32:31,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:32:31,906 INFO L87 Difference]: Start difference. First operand has 87 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 79 states have internal predecessors, (113), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 15:32:31,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:31,935 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2025-01-09 15:32:31,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:32:31,937 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-01-09 15:32:31,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:31,941 INFO L225 Difference]: With dead ends: 168 [2025-01-09 15:32:31,941 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 15:32:31,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:32:31,945 INFO L435 NwaCegarLoop]: 120 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, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:31,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:32:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 15:32:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 15:32:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 15:32:31,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2025-01-09 15:32:31,970 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 73 [2025-01-09 15:32:31,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:31,971 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2025-01-09 15:32:31,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 15:32:31,971 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2025-01-09 15:32:31,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 15:32:31,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:31,973 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:31,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:32:32,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:32,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:32,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:32,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1186606166, now seen corresponding path program 1 times [2025-01-09 15:32:32,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:32,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734505677] [2025-01-09 15:32:32,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:32,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:32,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:32,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:32,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:32:32,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 15:32:32,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 15:32:32,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:32,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:32,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:32:32,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 15:32:32,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:32:32,586 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:32,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734505677] [2025-01-09 15:32:32,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734505677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:32:32,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:32:32,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:32:32,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389906243] [2025-01-09 15:32:32,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:32,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:32:32,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:32,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:32:32,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:32:32,588 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 15:32:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:32,665 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2025-01-09 15:32:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:32:32,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2025-01-09 15:32:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:32,668 INFO L225 Difference]: With dead ends: 167 [2025-01-09 15:32:32,668 INFO L226 Difference]: Without dead ends: 86 [2025-01-09 15:32:32,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:32:32,671 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:32,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:32:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-01-09 15:32:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-01-09 15:32:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 15:32:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2025-01-09 15:32:32,677 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 73 [2025-01-09 15:32:32,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:32,678 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2025-01-09 15:32:32,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 15:32:32,680 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2025-01-09 15:32:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 15:32:32,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:32,683 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:32,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 15:32:32,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:32,884 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:32,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:32,885 INFO L85 PathProgramCache]: Analyzing trace with hash -833517784, now seen corresponding path program 1 times [2025-01-09 15:32:32,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:32,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713530967] [2025-01-09 15:32:32,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:32,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:32,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:32,887 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:32,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 15:32:32,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 15:32:33,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 15:32:33,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:33,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:33,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:32:33,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 15:32:33,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:32:33,273 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:33,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713530967] [2025-01-09 15:32:33,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713530967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:32:33,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:32:33,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:32:33,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431374138] [2025-01-09 15:32:33,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:33,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:32:33,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:33,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:32:33,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:32:33,275 INFO L87 Difference]: Start difference. First operand 86 states and 122 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 15:32:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:33,390 INFO L93 Difference]: Finished difference Result 176 states and 251 transitions. [2025-01-09 15:32:33,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:32:33,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-01-09 15:32:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:33,391 INFO L225 Difference]: With dead ends: 176 [2025-01-09 15:32:33,391 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 15:32:33,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:32:33,392 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 544 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:33,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 544 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:32:33,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 15:32:33,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2025-01-09 15:32:33,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 15:32:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2025-01-09 15:32:33,401 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 73 [2025-01-09 15:32:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:33,401 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2025-01-09 15:32:33,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 15:32:33,402 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2025-01-09 15:32:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 15:32:33,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:33,403 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:33,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 15:32:33,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:33,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:33,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:33,605 INFO L85 PathProgramCache]: Analyzing trace with hash 941489578, now seen corresponding path program 1 times [2025-01-09 15:32:33,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:33,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146692672] [2025-01-09 15:32:33,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:33,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:33,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:33,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:33,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 15:32:33,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 15:32:34,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 15:32:34,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:34,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:34,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 15:32:34,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:35,075 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-01-09 15:32:35,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 59 [2025-01-09 15:32:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 15:32:35,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:32:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 15:32:35,568 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:35,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146692672] [2025-01-09 15:32:35,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146692672] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:32:35,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:32:35,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-01-09 15:32:35,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773399053] [2025-01-09 15:32:35,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:35,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:32:35,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:35,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:32:35,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:32:35,571 INFO L87 Difference]: Start difference. First operand 92 states and 128 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 15:32:36,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:36,338 INFO L93 Difference]: Finished difference Result 245 states and 340 transitions. [2025-01-09 15:32:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:32:36,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-01-09 15:32:36,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:36,341 INFO L225 Difference]: With dead ends: 245 [2025-01-09 15:32:36,341 INFO L226 Difference]: Without dead ends: 156 [2025-01-09 15:32:36,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:32:36,342 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 76 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:36,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 385 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:32:36,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-01-09 15:32:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2025-01-09 15:32:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 142 states have (on average 1.380281690140845) internal successors, (196), 143 states have internal predecessors, (196), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 15:32:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 212 transitions. [2025-01-09 15:32:36,348 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 212 transitions. Word has length 73 [2025-01-09 15:32:36,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:36,348 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 212 transitions. [2025-01-09 15:32:36,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 15:32:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 212 transitions. [2025-01-09 15:32:36,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 15:32:36,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:36,349 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:36,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:32:36,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:36,550 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:36,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:36,550 INFO L85 PathProgramCache]: Analyzing trace with hash -646858324, now seen corresponding path program 1 times [2025-01-09 15:32:36,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:36,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645775301] [2025-01-09 15:32:36,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:36,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:36,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:36,554 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:36,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 15:32:36,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 15:32:36,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 15:32:36,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:36,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:36,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 15:32:36,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:37,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:32:38,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2025-01-09 15:32:38,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:32:38,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 58 [2025-01-09 15:32:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 15:32:38,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:32:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 15:32:39,087 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:39,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645775301] [2025-01-09 15:32:39,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645775301] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:32:39,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:32:39,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-01-09 15:32:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100411630] [2025-01-09 15:32:39,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:32:39,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:32:39,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:39,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:32:39,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:32:39,088 INFO L87 Difference]: Start difference. First operand 153 states and 212 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 15:32:39,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:32:39,600 INFO L93 Difference]: Finished difference Result 370 states and 508 transitions. [2025-01-09 15:32:39,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:32:39,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 73 [2025-01-09 15:32:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:32:39,606 INFO L225 Difference]: With dead ends: 370 [2025-01-09 15:32:39,606 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 15:32:39,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:32:39,607 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 78 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:32:39,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 281 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:32:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 15:32:39,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 153. [2025-01-09 15:32:39,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 143 states have internal predecessors, (195), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-09 15:32:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 211 transitions. [2025-01-09 15:32:39,629 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 211 transitions. Word has length 73 [2025-01-09 15:32:39,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:32:39,629 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 211 transitions. [2025-01-09 15:32:39,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 15:32:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 211 transitions. [2025-01-09 15:32:39,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 15:32:39,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:32:39,634 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:32:39,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 15:32:39,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:39,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:32:39,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:32:39,835 INFO L85 PathProgramCache]: Analyzing trace with hash -224156498, now seen corresponding path program 1 times [2025-01-09 15:32:39,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:32:39,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430304806] [2025-01-09 15:32:39,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:39,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:32:39,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:32:39,838 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:32:39,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 15:32:39,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 15:32:40,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 15:32:40,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:40,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:40,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 15:32:40,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:41,077 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-01-09 15:32:41,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 59 [2025-01-09 15:32:41,291 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 15:32:41,292 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 130 treesize of output 58 [2025-01-09 15:32:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 15:32:41,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:32:41,696 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:32:41,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430304806] [2025-01-09 15:32:41,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430304806] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:32:41,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [855342258] [2025-01-09 15:32:41,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:32:41,697 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:32:41,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:32:41,699 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:32:41,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-01-09 15:32:41,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 15:32:42,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 15:32:42,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:32:42,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:32:42,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 15:32:42,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:32:43,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 15:32:44,282 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2025-01-09 15:32:44,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 59 [2025-01-09 15:32:44,648 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 15:32:44,648 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 130 treesize of output 58 [2025-01-09 15:32:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 15:32:44,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:32:44,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [855342258] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:32:44,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:32:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-01-09 15:32:44,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719979279] [2025-01-09 15:32:44,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:32:44,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:32:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:32:44,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:32:44,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:32:44,912 INFO L87 Difference]: Start difference. First operand 153 states and 211 transitions. Second operand has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 4 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 15:32:49,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:32:51,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:32:53,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:32:56,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:32:59,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:33:02,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:33:05,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:33:08,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:33:11,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:33:13,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:33:16,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:33:20,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:33:22,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:33:24,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:33:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:33:25,943 INFO L93 Difference]: Finished difference Result 504 states and 694 transitions. [2025-01-09 15:33:25,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:33:25,944 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 4 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 73 [2025-01-09 15:33:25,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:33:25,947 INFO L225 Difference]: With dead ends: 504 [2025-01-09 15:33:25,949 INFO L226 Difference]: Without dead ends: 354 [2025-01-09 15:33:25,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 178 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2025-01-09 15:33:25,950 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 878 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 49 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:33:25,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 755 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 672 Invalid, 4 Unknown, 0 Unchecked, 40.1s Time] [2025-01-09 15:33:25,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-01-09 15:33:25,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 293. [2025-01-09 15:33:25,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 272 states have (on average 1.375) internal successors, (374), 275 states have internal predecessors, (374), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 15:33:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 406 transitions. [2025-01-09 15:33:25,995 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 406 transitions. Word has length 73 [2025-01-09 15:33:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:33:25,995 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 406 transitions. [2025-01-09 15:33:25,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 4 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 15:33:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 406 transitions. [2025-01-09 15:33:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 15:33:25,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:33:25,998 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:33:26,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2025-01-09 15:33:26,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2025-01-09 15:33:26,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 15:33:26,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:33:26,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:33:26,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1716878346, now seen corresponding path program 1 times [2025-01-09 15:33:26,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:33:26,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198011575] [2025-01-09 15:33:26,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:33:26,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:33:26,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:33:26,406 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:33:26,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-01-09 15:33:26,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 15:33:26,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 15:33:26,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:33:26,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:33:26,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 15:33:26,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:33:27,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:33:28,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 59 [2025-01-09 15:33:29,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:33:29,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 80 [2025-01-09 15:33:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 15:33:29,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:33:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-09 15:33:31,179 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:33:31,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198011575] [2025-01-09 15:33:31,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1198011575] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:33:31,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:33:31,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2025-01-09 15:33:31,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327227637] [2025-01-09 15:33:31,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:33:31,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:33:31,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:33:31,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:33:31,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:33:31,180 INFO L87 Difference]: Start difference. First operand 293 states and 406 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 15:33:33,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:33:33,788 INFO L93 Difference]: Finished difference Result 763 states and 1046 transitions. [2025-01-09 15:33:33,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:33:33,788 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 74 [2025-01-09 15:33:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:33:33,790 INFO L225 Difference]: With dead ends: 763 [2025-01-09 15:33:33,790 INFO L226 Difference]: Without dead ends: 473 [2025-01-09 15:33:33,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2025-01-09 15:33:33,791 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 414 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:33:33,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 760 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 15:33:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-01-09 15:33:33,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 311. [2025-01-09 15:33:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 290 states have (on average 1.3758620689655172) internal successors, (399), 293 states have internal predecessors, (399), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 15:33:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 431 transitions. [2025-01-09 15:33:33,805 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 431 transitions. Word has length 74 [2025-01-09 15:33:33,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:33:33,805 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 431 transitions. [2025-01-09 15:33:33,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-09 15:33:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 431 transitions. [2025-01-09 15:33:33,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 15:33:33,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:33:33,806 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:33:33,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-01-09 15:33:34,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:33:34,007 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:33:34,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:33:34,007 INFO L85 PathProgramCache]: Analyzing trace with hash -599078313, now seen corresponding path program 1 times [2025-01-09 15:33:34,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:33:34,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168815506] [2025-01-09 15:33:34,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:33:34,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:33:34,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:33:34,009 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:33:34,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-01-09 15:33:34,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 15:33:34,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 15:33:34,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:33:34,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:33:34,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 15:33:34,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:33:35,251 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 29 treesize of output 17 [2025-01-09 15:33:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 15:33:35,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:33:36,309 INFO L349 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2025-01-09 15:33:36,309 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 34 treesize of output 27 [2025-01-09 15:33:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 15:33:36,378 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:33:36,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168815506] [2025-01-09 15:33:36,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168815506] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:33:36,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:33:36,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2025-01-09 15:33:36,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84460414] [2025-01-09 15:33:36,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:33:36,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 15:33:36,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:33:36,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 15:33:36,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:33:36,380 INFO L87 Difference]: Start difference. First operand 311 states and 431 transitions. Second operand has 21 states, 17 states have (on average 4.529411764705882) internal successors, (77), 19 states have internal predecessors, (77), 6 states have call successors, (12), 4 states have call predecessors, (12), 6 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2025-01-09 15:33:44,644 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 15:33:52,741 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)