./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ba7d228400adb7b619cb4dcfa2812043db2ddc8d5c59df0fc89a78885f79394 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:11:02,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:11:02,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:11:02,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:11:02,761 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:11:02,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:11:02,782 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:11:02,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:11:02,783 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:11:02,783 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:11:02,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:11:02,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:11:02,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:11:02,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:11:02,783 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:11:02,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:11:02,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:11:02,783 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:11:02,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:11:02,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:11:02,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:11:02,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:11:02,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:11:02,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:11:02,784 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:11:02,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:11:02,784 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:11:02,784 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:11:02,784 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:11:02,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:11:02,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:11:02,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:11:02,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:11:02,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:11:02,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:11:02,784 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:11:02,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:11:02,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:11:02,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:11:02,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:11:02,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:11:02,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:11:02,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:11:02,787 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ba7d228400adb7b619cb4dcfa2812043db2ddc8d5c59df0fc89a78885f79394 [2025-03-17 06:11:03,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:11:03,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:11:03,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:11:03,046 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:11:03,046 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:11:03,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i [2025-03-17 06:11:04,236 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fad895ae/349d2d3e07b3419e9ef541a94f6bcf96/FLAG3ba13d5dc [2025-03-17 06:11:04,519 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:11:04,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i [2025-03-17 06:11:04,530 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fad895ae/349d2d3e07b3419e9ef541a94f6bcf96/FLAG3ba13d5dc [2025-03-17 06:11:04,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fad895ae/349d2d3e07b3419e9ef541a94f6bcf96 [2025-03-17 06:11:04,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:11:04,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:11:04,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:11:04,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:11:04,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:11:04,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:11:04" (1/1) ... [2025-03-17 06:11:04,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca6109a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:04, skipping insertion in model container [2025-03-17 06:11:04,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:11:04" (1/1) ... [2025-03-17 06:11:04,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:11:04,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i[917,930] [2025-03-17 06:11:04,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:11:04,772 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:11:04,781 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i[917,930] [2025-03-17 06:11:04,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:11:04,837 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:11:04,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:04 WrapperNode [2025-03-17 06:11:04,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:11:04,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:11:04,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:11:04,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:11:04,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:04" (1/1) ... [2025-03-17 06:11:04,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:04" (1/1) ... [2025-03-17 06:11:04,892 INFO L138 Inliner]: procedures = 30, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 519 [2025-03-17 06:11:04,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:11:04,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:11:04,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:11:04,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:11:04,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:04" (1/1) ... [2025-03-17 06:11:04,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:04" (1/1) ... [2025-03-17 06:11:04,909 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:04" (1/1) ... [2025-03-17 06:11:04,922 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:11:04,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:04" (1/1) ... [2025-03-17 06:11:04,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:04" (1/1) ... [2025-03-17 06:11:04,943 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:04" (1/1) ... [2025-03-17 06:11:04,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:04" (1/1) ... [2025-03-17 06:11:04,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:04" (1/1) ... [2025-03-17 06:11:04,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:04" (1/1) ... [2025-03-17 06:11:04,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:11:04,950 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:11:04,950 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:11:04,950 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:11:04,951 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:04" (1/1) ... [2025-03-17 06:11:04,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:11:04,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:04,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:11:04,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:11:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:11:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:11:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:11:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:11:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:11:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:11:05,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:11:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:11:05,006 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:11:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:11:05,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:11:05,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:11:05,094 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:11:05,095 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:11:05,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L136: havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite113#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~short115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short118#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short126#1;havoc property_#t~mem127#1;havoc property_#t~short128#1;havoc property_#t~mem129#1;havoc property_#t~ite142#1;havoc property_#t~mem130#1;havoc property_#t~ite139#1;havoc property_#t~mem134#1;havoc property_#t~mem131#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~ite138#1;havoc property_#t~mem137#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~mem141#1;havoc property_#t~mem140#1;havoc property_#t~short143#1; [2025-03-17 06:11:05,598 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-03-17 06:11:05,598 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:11:05,610 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:11:05,611 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:11:05,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:11:05 BoogieIcfgContainer [2025-03-17 06:11:05,612 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:11:05,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:11:05,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:11:05,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:11:05,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:11:04" (1/3) ... [2025-03-17 06:11:05,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3833ac59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:11:05, skipping insertion in model container [2025-03-17 06:11:05,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:04" (2/3) ... [2025-03-17 06:11:05,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3833ac59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:11:05, skipping insertion in model container [2025-03-17 06:11:05,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:11:05" (3/3) ... [2025-03-17 06:11:05,619 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-60.i [2025-03-17 06:11:05,629 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:11:05,630 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-60.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:11:05,673 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:11:05,681 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;@76be6472, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:11:05,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:11:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 96 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:11:05,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:11:05,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:05,692 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:05,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:05,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:05,696 INFO L85 PathProgramCache]: Analyzing trace with hash 786644201, now seen corresponding path program 1 times [2025-03-17 06:11:05,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:05,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074033945] [2025-03-17 06:11:05,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:05,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:05,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:11:05,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:11:05,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:05,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 06:11:06,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:06,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074033945] [2025-03-17 06:11:06,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074033945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:06,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880968059] [2025-03-17 06:11:06,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:06,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:06,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:06,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:06,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:11:06,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:11:06,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:11:06,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:06,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:06,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:11:06,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 06:11:06,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:06,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880968059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:06,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:11:06,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:11:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931757885] [2025-03-17 06:11:06,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:06,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:11:06,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:06,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:11:06,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:11:06,299 INFO L87 Difference]: Start difference. First operand has 113 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 96 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:11:06,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:06,318 INFO L93 Difference]: Finished difference Result 223 states and 355 transitions. [2025-03-17 06:11:06,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:11:06,319 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-17 06:11:06,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:06,328 INFO L225 Difference]: With dead ends: 223 [2025-03-17 06:11:06,328 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 06:11:06,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:11:06,332 INFO L435 NwaCegarLoop]: 167 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, 167 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:06,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 06:11:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-17 06:11:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 94 states have internal predecessors, (137), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:11:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 167 transitions. [2025-03-17 06:11:06,360 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 167 transitions. Word has length 130 [2025-03-17 06:11:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:06,360 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 167 transitions. [2025-03-17 06:11:06,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:11:06,360 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 167 transitions. [2025-03-17 06:11:06,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:11:06,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:06,363 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:06,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 06:11:06,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:11:06,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:06,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:06,565 INFO L85 PathProgramCache]: Analyzing trace with hash 761174274, now seen corresponding path program 1 times [2025-03-17 06:11:06,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:06,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725507259] [2025-03-17 06:11:06,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:06,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:06,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:11:06,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:11:06,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:06,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:11:06,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:06,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725507259] [2025-03-17 06:11:06,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725507259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:06,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:06,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:11:06,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620728790] [2025-03-17 06:11:06,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:06,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:11:06,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:06,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:11:06,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:11:06,852 INFO L87 Difference]: Start difference. First operand 111 states and 167 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:11:06,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:06,884 INFO L93 Difference]: Finished difference Result 224 states and 337 transitions. [2025-03-17 06:11:06,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:11:06,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-17 06:11:06,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:06,886 INFO L225 Difference]: With dead ends: 224 [2025-03-17 06:11:06,886 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 06:11:06,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:11:06,887 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 1 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:06,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 481 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 06:11:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-17 06:11:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 96 states have internal predecessors, (139), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:11:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 169 transitions. [2025-03-17 06:11:06,903 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 169 transitions. Word has length 130 [2025-03-17 06:11:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:06,904 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 169 transitions. [2025-03-17 06:11:06,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:11:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 169 transitions. [2025-03-17 06:11:06,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:11:06,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:06,906 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:06,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:11:06,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:06,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:06,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1648677955, now seen corresponding path program 1 times [2025-03-17 06:11:06,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:06,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078556189] [2025-03-17 06:11:06,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:06,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:06,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:11:07,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:11:07,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:07,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:11:07,061 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:11:07,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:11:07,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:11:07,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:07,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:11:07,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:11:07,210 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:11:07,211 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:11:07,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:11:07,214 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 06:11:07,330 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:11:07,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:11:07 BoogieIcfgContainer [2025-03-17 06:11:07,333 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:11:07,335 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:11:07,335 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:11:07,335 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:11:07,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:11:05" (3/4) ... [2025-03-17 06:11:07,339 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:11:07,340 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:11:07,340 INFO L158 Benchmark]: Toolchain (without parser) took 2787.60ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 98.5MB in the end (delta: 34.4MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2025-03-17 06:11:07,341 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:11:07,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.09ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 116.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:11:07,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.72ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 113.3MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:11:07,341 INFO L158 Benchmark]: Boogie Preprocessor took 56.70ms. Allocated memory is still 167.8MB. Free memory was 113.3MB in the beginning and 110.7MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:11:07,341 INFO L158 Benchmark]: IcfgBuilder took 661.98ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 76.7MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:11:07,341 INFO L158 Benchmark]: TraceAbstraction took 1719.28ms. Allocated memory is still 167.8MB. Free memory was 75.9MB in the beginning and 98.5MB in the end (delta: -22.6MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2025-03-17 06:11:07,342 INFO L158 Benchmark]: Witness Printer took 5.29ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 98.5MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:11:07,342 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.29ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.09ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 116.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.72ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 113.3MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.70ms. Allocated memory is still 167.8MB. Free memory was 113.3MB in the beginning and 110.7MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 661.98ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 76.7MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1719.28ms. Allocated memory is still 167.8MB. Free memory was 75.9MB in the beginning and 98.5MB in the end (delta: -22.6MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * Witness Printer took 5.29ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 98.5MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 91. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 9999.6, 64.25, 31.2, 1, 2, 10, 5.8, 1, 1, 64.8, 32.902, 10.5, 4.4, 999.375, 2.5, 8.6 }; [L59] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L60] double* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L61] double* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L62] signed long int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L63] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L64] signed long int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L65] float* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L66] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L67] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L68] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L69] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L70] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L71] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L72] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L73] double* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L74] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L75] float last_1_WrapperStruct00_var_1_16 = 8.6; [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] CALL updateLastVariables() [L133] EXPR WrapperStruct00.var_1_16 [L133] last_1_WrapperStruct00_var_1_16 = WrapperStruct00.var_1_16 [L143] RET updateLastVariables() [L144] CALL updateVariables() [L105] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L106] EXPR WrapperStruct00.var_1_2 [L106] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_2 [L106] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L106] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L107] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_3 [L108] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_3 [L108] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L108] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L109] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L111] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L112] WrapperStruct00.var_1_6 = __VERIFIER_nondet_long() [L113] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L114] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L115] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L117] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L118] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L120] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L121] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L122] EXPR WrapperStruct00.var_1_10 [L122] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L122] EXPR WrapperStruct00.var_1_10 [L122] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L122] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L122] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L122] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L123] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L124] EXPR WrapperStruct00.var_1_11 [L124] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L124] EXPR WrapperStruct00.var_1_11 [L124] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L124] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L124] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L124] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L125] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L126] EXPR WrapperStruct00.var_1_12 [L126] EXPR WrapperStruct00.var_1_12 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L126] EXPR WrapperStruct00.var_1_12 [L126] EXPR WrapperStruct00.var_1_12 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L126] EXPR (WrapperStruct00.var_1_12 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L126] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L126] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L127] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L128] EXPR WrapperStruct00.var_1_13 [L128] EXPR WrapperStruct00.var_1_13 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L128] EXPR WrapperStruct00.var_1_13 [L128] EXPR WrapperStruct00.var_1_13 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L128] EXPR (WrapperStruct00.var_1_13 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L128] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L128] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L129] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L130] EXPR WrapperStruct00.var_1_14 [L130] EXPR WrapperStruct00.var_1_14 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L130] EXPR WrapperStruct00.var_1_14 [L130] EXPR WrapperStruct00.var_1_14 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L130] EXPR (WrapperStruct00.var_1_14 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L130] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L130] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L144] RET updateVariables() [L145] CALL step() [L79] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L79] (*(WrapperStruct00_var_1_1_Pointer)) = ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) [L80] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L80] COND FALSE !((- (*(WrapperStruct00_var_1_5_Pointer))) >= (*(WrapperStruct00_var_1_6_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L89] unsigned char stepLocal_0 = (*(WrapperStruct00_var_1_9_Pointer)); [L90] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5, stepLocal_0=-255] [L90] COND TRUE (*(WrapperStruct00_var_1_8_Pointer)) && stepLocal_0 [L91] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L91] (*(WrapperStruct00_var_1_7_Pointer)) = (((*(WrapperStruct00_var_1_10_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer))) + ((*(WrapperStruct00_var_1_12_Pointer)) + ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) [L93] (*(WrapperStruct00_var_1_15_Pointer)) = 500.25 [L94] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L94] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer)) > last_1_WrapperStruct00_var_1_16) [L101] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L101] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L136] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L136] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L136] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) && (((- (*(WrapperStruct00_var_1_5_Pointer))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) > (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (256 - ((*(WrapperStruct00_var_1_5_Pointer)) + 5)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L136] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) && (((- (*(WrapperStruct00_var_1_5_Pointer))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) > (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (256 - ((*(WrapperStruct00_var_1_5_Pointer)) + 5)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1)) && (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((float) (((*(WrapperStruct00_var_1_10_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer))) + ((*(WrapperStruct00_var_1_12_Pointer)) + ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L136] EXPR ((((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) && (((- (*(WrapperStruct00_var_1_5_Pointer))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) > (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (256 - ((*(WrapperStruct00_var_1_5_Pointer)) + 5)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1)) && (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((float) (((*(WrapperStruct00_var_1_10_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer))) + ((*(WrapperStruct00_var_1_12_Pointer)) + ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((double) 500.25)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L136] EXPR (((((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) && (((- (*(WrapperStruct00_var_1_5_Pointer))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) > (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (256 - ((*(WrapperStruct00_var_1_5_Pointer)) + 5)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1)) && (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((float) (((*(WrapperStruct00_var_1_10_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer))) + ((*(WrapperStruct00_var_1_12_Pointer)) + ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((double) 500.25))) && (((*(WrapperStruct00_var_1_2_Pointer)) > last_1_WrapperStruct00_var_1_16) ? ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= ((((last_1_WrapperStruct00_var_1_16) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? (last_1_WrapperStruct00_var_1_16) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))))) : 1) : 1) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L136-L137] return (((((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) && (((- (*(WrapperStruct00_var_1_5_Pointer))) >= (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) > (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (256 - ((*(WrapperStruct00_var_1_5_Pointer)) + 5)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1)) && (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((float) (((*(WrapperStruct00_var_1_10_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer))) + ((*(WrapperStruct00_var_1_12_Pointer)) + ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((double) 500.25))) && (((*(WrapperStruct00_var_1_2_Pointer)) > last_1_WrapperStruct00_var_1_16) ? ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) <= ((((last_1_WrapperStruct00_var_1_16) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? (last_1_WrapperStruct00_var_1_16) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))))) : 1) : 1) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:39}, WrapperStruct00_var_1_11_Pointer={4:43}, WrapperStruct00_var_1_12_Pointer={4:47}, WrapperStruct00_var_1_13_Pointer={4:51}, WrapperStruct00_var_1_14_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:16}, WrapperStruct00_var_1_4_Pointer={4:24}, WrapperStruct00_var_1_5_Pointer={4:28}, WrapperStruct00_var_1_6_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:33}, WrapperStruct00_var_1_8_Pointer={4:37}, WrapperStruct00_var_1_9_Pointer={4:38}, isInitial=1, last_1_WrapperStruct00_var_1_16=43/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 186 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 15, 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, 648 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 317 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 331 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 520 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 387 ConstructedInterpolants, 0 QuantifiedInterpolants, 389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 561 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1232/1260 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 06:11:07,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ba7d228400adb7b619cb4dcfa2812043db2ddc8d5c59df0fc89a78885f79394 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:11:09,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:11:09,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:11:09,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:11:09,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:11:09,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:11:09,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:11:09,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:11:09,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:11:09,479 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:11:09,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:11:09,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:11:09,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:11:09,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:11:09,480 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:11:09,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:11:09,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:11:09,481 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:11:09,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:11:09,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:11:09,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:11:09,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:11:09,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:11:09,481 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:11:09,481 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:11:09,481 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:11:09,482 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:11:09,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:11:09,482 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:11:09,482 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:11:09,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:11:09,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:11:09,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:11:09,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:11:09,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:11:09,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:11:09,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:11:09,483 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:11:09,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:11:09,483 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:11:09,483 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:11:09,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:11:09,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:11:09,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:11:09,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:11:09,484 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ba7d228400adb7b619cb4dcfa2812043db2ddc8d5c59df0fc89a78885f79394 [2025-03-17 06:11:09,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:11:09,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:11:09,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:11:09,740 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:11:09,740 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:11:09,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i [2025-03-17 06:11:10,999 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49545832f/b389fc60377f42188f9eee8f955923a0/FLAGb408c6c77 [2025-03-17 06:11:11,184 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:11:11,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i [2025-03-17 06:11:11,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49545832f/b389fc60377f42188f9eee8f955923a0/FLAGb408c6c77 [2025-03-17 06:11:11,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49545832f/b389fc60377f42188f9eee8f955923a0 [2025-03-17 06:11:11,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:11:11,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:11:11,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:11:11,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:11:11,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:11:11,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:11:11" (1/1) ... [2025-03-17 06:11:11,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3508187b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:11, skipping insertion in model container [2025-03-17 06:11:11,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:11:11" (1/1) ... [2025-03-17 06:11:11,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:11:11,341 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i[917,930] [2025-03-17 06:11:11,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:11:11,424 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:11:11,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i[917,930] [2025-03-17 06:11:11,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:11:11,506 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:11:11,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:11 WrapperNode [2025-03-17 06:11:11,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:11:11,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:11:11,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:11:11,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:11:11,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:11" (1/1) ... [2025-03-17 06:11:11,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:11" (1/1) ... [2025-03-17 06:11:11,559 INFO L138 Inliner]: procedures = 37, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 517 [2025-03-17 06:11:11,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:11:11,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:11:11,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:11:11,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:11:11,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:11" (1/1) ... [2025-03-17 06:11:11,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:11" (1/1) ... [2025-03-17 06:11:11,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:11" (1/1) ... [2025-03-17 06:11:11,609 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2025-03-17 06:11:11,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:11" (1/1) ... [2025-03-17 06:11:11,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:11" (1/1) ... [2025-03-17 06:11:11,630 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:11" (1/1) ... [2025-03-17 06:11:11,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:11" (1/1) ... [2025-03-17 06:11:11,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:11" (1/1) ... [2025-03-17 06:11:11,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:11" (1/1) ... [2025-03-17 06:11:11,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:11:11,654 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:11:11,654 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:11:11,654 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:11:11,655 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:11" (1/1) ... [2025-03-17 06:11:11,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:11:11,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:11,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:11:11,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:11:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:11:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 06:11:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 06:11:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-17 06:11:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-17 06:11:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 06:11:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 06:11:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:11:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:11:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:11:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:11:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:11:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:11:11,703 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:11:11,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 06:11:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 06:11:11,804 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:11:11,805 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:11:19,927 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L136: havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite113#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~short115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short118#1;havoc property_#t~ite125#1;havoc property_#t~mem124#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short126#1;havoc property_#t~mem127#1;havoc property_#t~short128#1;havoc property_#t~mem129#1;havoc property_#t~ite142#1;havoc property_#t~mem130#1;havoc property_#t~ite139#1;havoc property_#t~mem134#1;havoc property_#t~mem131#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~ite138#1;havoc property_#t~mem137#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~mem141#1;havoc property_#t~mem140#1;havoc property_#t~short143#1; [2025-03-17 06:11:19,964 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-03-17 06:11:19,964 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:11:19,974 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:11:19,974 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:11:19,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:11:19 BoogieIcfgContainer [2025-03-17 06:11:19,974 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:11:19,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:11:19,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:11:19,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:11:19,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:11:11" (1/3) ... [2025-03-17 06:11:19,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff6fad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:11:19, skipping insertion in model container [2025-03-17 06:11:19,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:11" (2/3) ... [2025-03-17 06:11:19,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff6fad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:11:19, skipping insertion in model container [2025-03-17 06:11:19,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:11:19" (3/3) ... [2025-03-17 06:11:19,980 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-60.i [2025-03-17 06:11:19,989 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:11:19,990 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-60.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:11:20,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:11:20,038 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;@5ffd21ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:11:20,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:11:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 96 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:11:20,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:11:20,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:20,050 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:20,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:20,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:20,054 INFO L85 PathProgramCache]: Analyzing trace with hash -870868656, now seen corresponding path program 1 times [2025-03-17 06:11:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:11:20,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021214875] [2025-03-17 06:11:20,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:20,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:11:20,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:11:20,066 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:11:20,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 06:11:20,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:11:20,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:11:20,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:20,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:20,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:11:20,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-17 06:11:20,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:20,797 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:11:20,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021214875] [2025-03-17 06:11:20,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021214875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:20,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:20,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:11:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441096960] [2025-03-17 06:11:20,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:20,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:11:20,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:11:20,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:11:20,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:11:20,822 INFO L87 Difference]: Start difference. First operand has 113 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 96 states have internal predecessors, (141), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:11:20,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:20,848 INFO L93 Difference]: Finished difference Result 223 states and 355 transitions. [2025-03-17 06:11:20,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:11:20,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-17 06:11:20,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:20,855 INFO L225 Difference]: With dead ends: 223 [2025-03-17 06:11:20,855 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 06:11:20,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:11:20,862 INFO L435 NwaCegarLoop]: 167 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, 167 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:20,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 06:11:20,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-17 06:11:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 94 states have internal predecessors, (137), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:11:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 167 transitions. [2025-03-17 06:11:20,892 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 167 transitions. Word has length 130 [2025-03-17 06:11:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:20,892 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 167 transitions. [2025-03-17 06:11:20,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:11:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 167 transitions. [2025-03-17 06:11:20,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:11:20,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:20,896 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:20,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 06:11:21,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:11:21,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:21,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash -896338583, now seen corresponding path program 1 times [2025-03-17 06:11:21,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:11:21,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049463561] [2025-03-17 06:11:21,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:21,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:11:21,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:11:21,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:11:21,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 06:11:21,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:11:21,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:11:21,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:21,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:21,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:11:21,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:11:21,803 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:21,803 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:11:21,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049463561] [2025-03-17 06:11:21,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049463561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:21,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:21,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:11:21,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766486801] [2025-03-17 06:11:21,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:21,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:11:21,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:11:21,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:11:21,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:11:21,805 INFO L87 Difference]: Start difference. First operand 111 states and 167 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:11:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:21,980 INFO L93 Difference]: Finished difference Result 223 states and 336 transitions. [2025-03-17 06:11:21,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:11:21,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-17 06:11:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:21,990 INFO L225 Difference]: With dead ends: 223 [2025-03-17 06:11:21,990 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 06:11:21,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:11:21,991 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:21,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:11:21,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 06:11:21,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-17 06:11:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 96 states have internal predecessors, (139), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:11:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 169 transitions. [2025-03-17 06:11:21,999 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 169 transitions. Word has length 130 [2025-03-17 06:11:21,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:22,000 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 169 transitions. [2025-03-17 06:11:22,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:11:22,000 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 169 transitions. [2025-03-17 06:11:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:11:22,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:22,005 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:22,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 06:11:22,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:11:22,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:22,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:22,206 INFO L85 PathProgramCache]: Analyzing trace with hash -255252440, now seen corresponding path program 1 times [2025-03-17 06:11:22,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:11:22,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298528762] [2025-03-17 06:11:22,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:22,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:11:22,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:11:22,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:11:22,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 06:11:22,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:11:22,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:11:22,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:22,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:22,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:11:22,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:11:22,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:22,891 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:11:22,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298528762] [2025-03-17 06:11:22,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298528762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:22,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:22,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:11:22,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390684616] [2025-03-17 06:11:22,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:22,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:11:22,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:11:22,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:11:22,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:11:22,892 INFO L87 Difference]: Start difference. First operand 113 states and 169 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:11:23,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:23,104 INFO L93 Difference]: Finished difference Result 230 states and 344 transitions. [2025-03-17 06:11:23,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:11:23,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-17 06:11:23,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:23,106 INFO L225 Difference]: With dead ends: 230 [2025-03-17 06:11:23,106 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 06:11:23,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:11:23,107 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:23,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 633 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:11:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 06:11:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-17 06:11:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.43) internal successors, (143), 100 states have internal predecessors, (143), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:11:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2025-03-17 06:11:23,114 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 130 [2025-03-17 06:11:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:23,114 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2025-03-17 06:11:23,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:11:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2025-03-17 06:11:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:11:23,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:23,119 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:23,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 06:11:23,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:11:23,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:23,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:23,320 INFO L85 PathProgramCache]: Analyzing trace with hash 632251241, now seen corresponding path program 1 times [2025-03-17 06:11:23,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:11:23,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823478470] [2025-03-17 06:11:23,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:23,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:11:23,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:11:23,322 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:11:23,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 06:11:23,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:11:23,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:11:23,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:23,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:23,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:11:23,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:24,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:11:24,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-17 06:11:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:11:24,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:24,108 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:11:24,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823478470] [2025-03-17 06:11:24,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823478470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:24,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:24,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:11:24,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371053508] [2025-03-17 06:11:24,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:24,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:11:24,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:11:24,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:11:24,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:11:24,109 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:11:27,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:11:29,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:11:32,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:11:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:32,803 INFO L93 Difference]: Finished difference Result 234 states and 346 transitions. [2025-03-17 06:11:32,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:11:32,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-17 06:11:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:32,807 INFO L225 Difference]: With dead ends: 234 [2025-03-17 06:11:32,807 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 06:11:32,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:11:32,809 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 164 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:32,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 437 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2025-03-17 06:11:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 06:11:32,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-17 06:11:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 100 states have (on average 1.42) internal successors, (142), 100 states have internal predecessors, (142), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:11:32,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2025-03-17 06:11:32,821 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 130 [2025-03-17 06:11:32,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:32,821 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2025-03-17 06:11:32,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:11:32,821 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2025-03-17 06:11:32,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:11:32,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:32,822 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:32,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 06:11:33,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:11:33,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:33,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:33,023 INFO L85 PathProgramCache]: Analyzing trace with hash -566082709, now seen corresponding path program 1 times [2025-03-17 06:11:33,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:11:33,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9011798] [2025-03-17 06:11:33,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:33,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:11:33,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:11:33,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:11:33,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 06:11:33,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:11:33,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:11:33,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:33,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:33,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:11:33,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:33,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:11:33,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-17 06:11:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:11:33,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:33,796 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:11:33,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9011798] [2025-03-17 06:11:33,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9011798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:33,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:11:33,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:11:33,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74367831] [2025-03-17 06:11:33,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:33,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:11:33,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:11:33,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:11:33,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:11:33,800 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:11:35,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:11:37,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:11:40,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:11:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:40,847 INFO L93 Difference]: Finished difference Result 233 states and 343 transitions. [2025-03-17 06:11:40,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:11:40,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2025-03-17 06:11:40,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:40,851 INFO L225 Difference]: With dead ends: 233 [2025-03-17 06:11:40,851 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 06:11:40,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:11:40,852 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 154 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:40,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 431 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2025-03-17 06:11:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 06:11:40,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-03-17 06:11:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 98 states have internal predecessors, (139), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:11:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2025-03-17 06:11:40,863 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 132 [2025-03-17 06:11:40,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:40,863 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2025-03-17 06:11:40,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:11:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2025-03-17 06:11:40,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 06:11:40,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:40,865 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:40,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 06:11:41,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:11:41,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:41,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:41,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1530504982, now seen corresponding path program 1 times [2025-03-17 06:11:41,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:11:41,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421367318] [2025-03-17 06:11:41,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:41,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:11:41,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:11:41,069 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:11:41,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 06:11:41,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 06:11:41,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 06:11:41,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:41,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:41,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 06:11:41,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:41,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:11:41,861 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 172 treesize of output 64 [2025-03-17 06:11:41,952 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 104 proven. 4 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 06:11:41,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:11:42,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:11:42,308 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 110 treesize of output 1 [2025-03-17 06:11:42,315 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 06:11:42,315 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:11:42,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421367318] [2025-03-17 06:11:42,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421367318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 06:11:42,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:11:42,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-03-17 06:11:42,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288052675] [2025-03-17 06:11:42,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:11:42,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:11:42,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:11:42,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:11:42,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:11:42,317 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 12 states have internal predecessors, (85), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-17 06:11:44,288 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-03-17 06:11:47,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:11:51,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:11:53,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:11:56,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:11:59,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:59,474 INFO L93 Difference]: Finished difference Result 242 states and 352 transitions. [2025-03-17 06:11:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 06:11:59,477 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 12 states have internal predecessors, (85), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) Word has length 134 [2025-03-17 06:11:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:59,478 INFO L225 Difference]: With dead ends: 242 [2025-03-17 06:11:59,478 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 06:11:59,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-17 06:11:59,479 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 145 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:59,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 609 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 581 Invalid, 1 Unknown, 0 Unchecked, 16.8s Time] [2025-03-17 06:11:59,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 06:11:59,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-03-17 06:11:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:11:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2025-03-17 06:11:59,486 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 134 [2025-03-17 06:11:59,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:59,486 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2025-03-17 06:11:59,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 12 states have internal predecessors, (85), 4 states have call successors, (29), 3 states have call predecessors, (29), 4 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2025-03-17 06:11:59,486 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2025-03-17 06:11:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 06:11:59,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:59,487 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:59,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 06:11:59,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:11:59,688 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:59,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:59,693 INFO L85 PathProgramCache]: Analyzing trace with hash 372955113, now seen corresponding path program 1 times [2025-03-17 06:11:59,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:11:59,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803950800] [2025-03-17 06:11:59,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:59,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:11:59,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:11:59,696 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:11:59,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 06:11:59,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 06:12:00,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 06:12:00,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:00,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:00,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:12:00,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:00,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 06:12:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 06:12:00,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:00,634 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:12:00,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803950800] [2025-03-17 06:12:00,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803950800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:00,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:00,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:12:00,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108961919] [2025-03-17 06:12:00,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:00,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:12:00,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:12:00,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:12:00,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:12:00,635 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:04,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:12:07,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:12:09,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:12:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:10,455 INFO L93 Difference]: Finished difference Result 230 states and 334 transitions. [2025-03-17 06:12:10,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:12:10,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-17 06:12:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:10,460 INFO L225 Difference]: With dead ends: 230 [2025-03-17 06:12:10,460 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 06:12:10,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:12:10,460 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 117 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:10,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 418 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 1 Unknown, 0 Unchecked, 9.8s Time] [2025-03-17 06:12:10,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 06:12:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-17 06:12:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 166 transitions. [2025-03-17 06:12:10,466 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 166 transitions. Word has length 134 [2025-03-17 06:12:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:10,466 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 166 transitions. [2025-03-17 06:12:10,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 166 transitions. [2025-03-17 06:12:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 06:12:10,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:10,468 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:10,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 06:12:10,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:12:10,669 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:10,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:10,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1692232171, now seen corresponding path program 1 times [2025-03-17 06:12:10,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:12:10,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789057041] [2025-03-17 06:12:10,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:10,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:12:10,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:12:10,671 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:12:10,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 06:12:10,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 06:12:11,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 06:12:11,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:11,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:11,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:12:11,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:11,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 06:12:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-03-17 06:12:11,678 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:11,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:12:11,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789057041] [2025-03-17 06:12:11,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789057041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:11,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:11,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:12:11,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559793271] [2025-03-17 06:12:11,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:11,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:12:11,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:12:11,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:12:11,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:12:11,680 INFO L87 Difference]: Start difference. First operand 115 states and 166 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:15,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:12:17,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:12:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:20,215 INFO L93 Difference]: Finished difference Result 230 states and 332 transitions. [2025-03-17 06:12:20,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:12:20,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-03-17 06:12:20,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:20,221 INFO L225 Difference]: With dead ends: 230 [2025-03-17 06:12:20,221 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 06:12:20,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:12:20,222 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 108 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:20,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 416 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2025-03-17 06:12:20,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 06:12:20,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-17 06:12:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2025-03-17 06:12:20,229 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 136 [2025-03-17 06:12:20,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:20,230 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2025-03-17 06:12:20,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2025-03-17 06:12:20,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 06:12:20,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:20,232 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:20,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-17 06:12:20,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:12:20,433 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:20,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:20,433 INFO L85 PathProgramCache]: Analyzing trace with hash 695930985, now seen corresponding path program 1 times [2025-03-17 06:12:20,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:12:20,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639579282] [2025-03-17 06:12:20,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:20,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:12:20,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:12:20,436 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:12:20,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-17 06:12:20,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes.