./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 e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-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-?-e2fb8be-m
[2025-03-08 17:04:25,137 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 17:04:25,187 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 17:04:25,191 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 17:04:25,191 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 17:04:25,205 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 17:04:25,205 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 17:04:25,205 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 17:04:25,206 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 17:04:25,206 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 17:04:25,206 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 17:04:25,206 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 17:04:25,206 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 17:04:25,206 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 17:04:25,206 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 17:04:25,206 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 17:04:25,207 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 17:04:25,207 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 17:04:25,207 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 17:04:25,207 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 17:04:25,207 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 17:04:25,207 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 17:04:25,208 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 17:04:25,208 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 17:04:25,208 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 17:04:25,208 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 17:04:25,208 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 17:04:25,209 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 17:04:25,209 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 17:04:25,209 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 17:04:25,209 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 17:04:25,209 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 17:04:25,209 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 17:04:25,209 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 17:04:25,209 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 17:04:25,209 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 17:04:25,209 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 17:04:25,209 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 17:04:25,209 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 17:04:25,209 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 17:04:25,209 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 17:04:25,209 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 17:04:25,209 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 17:04:25,209 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-08 17:04:25,440 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 17:04:25,448 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 17:04:25,451 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 17:04:25,452 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 17:04:25,452 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 17:04:25,453 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-08 17:04:26,623 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b4f4c59/230422fbbb024324ad179215b4f549e0/FLAGad96fcdf1
[2025-03-08 17:04:26,849 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 17:04:26,849 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i
[2025-03-08 17:04:26,855 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b4f4c59/230422fbbb024324ad179215b4f549e0/FLAGad96fcdf1
[2025-03-08 17:04:27,201 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b4f4c59/230422fbbb024324ad179215b4f549e0
[2025-03-08 17:04:27,202 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 17:04:27,203 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 17:04:27,204 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 17:04:27,204 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 17:04:27,207 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 17:04:27,208 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:04:27" (1/1) ...
[2025-03-08 17:04:27,209 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b32d127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:27, skipping insertion in model container
[2025-03-08 17:04:27,209 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:04:27" (1/1) ...
[2025-03-08 17:04:27,222 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 17:04:27,334 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-08 17:04:27,393 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 17:04:27,405 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 17:04:27,413 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-08 17:04:27,439 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 17:04:27,455 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 17:04:27,456 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:27 WrapperNode
[2025-03-08 17:04:27,456 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 17:04:27,456 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 17:04:27,456 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 17:04:27,457 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 17:04:27,460 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:27" (1/1) ...
[2025-03-08 17:04:27,471 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:27" (1/1) ...
[2025-03-08 17:04:27,505 INFO  L138                Inliner]: procedures = 30, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 519
[2025-03-08 17:04:27,505 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 17:04:27,506 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 17:04:27,506 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 17:04:27,506 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 17:04:27,514 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:27" (1/1) ...
[2025-03-08 17:04:27,514 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:27" (1/1) ...
[2025-03-08 17:04:27,521 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:27" (1/1) ...
[2025-03-08 17:04:27,525 WARN  L109           MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS
[2025-03-08 17:04:27,526 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:27" (1/1) ...
[2025-03-08 17:04:27,526 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:27" (1/1) ...
[2025-03-08 17:04:27,535 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:27" (1/1) ...
[2025-03-08 17:04:27,536 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:27" (1/1) ...
[2025-03-08 17:04:27,538 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:27" (1/1) ...
[2025-03-08 17:04:27,539 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:27" (1/1) ...
[2025-03-08 17:04:27,546 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 17:04:27,550 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 17:04:27,550 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 17:04:27,550 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 17:04:27,551 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:27" (1/1) ...
[2025-03-08 17:04:27,559 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 17:04:27,568 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 17:04:27,580 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 17:04:27,582 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 17:04:27,600 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 17:04:27,600 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~int
[2025-03-08 17:04:27,600 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~real
[2025-03-08 17:04:27,600 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2025-03-08 17:04:27,600 INFO  L130     BoogieDeclarations]: Found specification of procedure read~real
[2025-03-08 17:04:27,600 INFO  L130     BoogieDeclarations]: Found specification of procedure write~real
[2025-03-08 17:04:27,600 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2025-03-08 17:04:27,600 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 17:04:27,600 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 17:04:27,600 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2025-03-08 17:04:27,600 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 17:04:27,600 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 17:04:27,724 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 17:04:27,726 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 17:04:28,298 INFO  L1307  $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-08 17:04:28,338 INFO  L?                        ?]: Removed 121 outVars from TransFormulas that were not future-live.
[2025-03-08 17:04:28,339 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 17:04:28,347 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 17:04:28,347 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 17:04:28,347 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:04:28 BoogieIcfgContainer
[2025-03-08 17:04:28,348 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 17:04:28,349 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 17:04:28,350 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 17:04:28,353 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 17:04:28,353 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:04:27" (1/3) ...
[2025-03-08 17:04:28,354 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f658bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:04:28, skipping insertion in model container
[2025-03-08 17:04:28,354 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:27" (2/3) ...
[2025-03-08 17:04:28,354 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f658bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:04:28, skipping insertion in model container
[2025-03-08 17:04:28,354 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:04:28" (3/3) ...
[2025-03-08 17:04:28,355 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-60.i
[2025-03-08 17:04:28,365 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 17:04:28,367 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-60.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 17:04:28,417 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 17:04:28,425 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;@11f7afff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 17:04:28,425 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 17:04:28,428 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 118 states, 100 states have (on average 1.46) internal successors, (146), 101 states have internal predecessors, (146), 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-08 17:04:28,435 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-08 17:04:28,436 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 17:04:28,436 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-08 17:04:28,437 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 17:04:28,440 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:04:28,440 INFO  L85        PathProgramCache]: Analyzing trace with hash -2071185510, now seen corresponding path program 1 times
[2025-03-08 17:04:28,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:04:28,446 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657972403]
[2025-03-08 17:04:28,446 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:04:28,447 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:04:28,568 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 17:04:28,611 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 17:04:28,611 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:04:28,612 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:04:28,758 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-08 17:04:28,758 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:04:28,758 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657972403]
[2025-03-08 17:04:28,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657972403] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 17:04:28,759 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122221819]
[2025-03-08 17:04:28,759 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:04:28,759 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 17:04:28,759 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 17:04:28,763 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 17:04:28,764 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 17:04:28,909 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 17:04:28,989 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 17:04:28,990 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:04:28,990 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:04:28,993 INFO  L256         TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 17:04:28,997 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 17:04:29,012 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-08 17:04:29,012 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 17:04:29,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [122221819] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:04:29,012 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 17:04:29,012 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 17:04:29,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830330882]
[2025-03-08 17:04:29,014 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:04:29,017 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 17:04:29,018 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:04:29,028 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 17:04:29,029 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 17:04:29,030 INFO  L87              Difference]: Start difference. First operand  has 118 states, 100 states have (on average 1.46) internal successors, (146), 101 states have internal predecessors, (146), 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 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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-08 17:04:29,046 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 17:04:29,046 INFO  L93              Difference]: Finished difference Result 230 states and 362 transitions.
[2025-03-08 17:04:29,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 17:04:29,047 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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 134
[2025-03-08 17:04:29,047 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 17:04:29,051 INFO  L225             Difference]: With dead ends: 230
[2025-03-08 17:04:29,051 INFO  L226             Difference]: Without dead ends: 115
[2025-03-08 17:04:29,053 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 17:04:29,054 INFO  L435           NwaCegarLoop]: 171 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, 171 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 17:04:29,054 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 17:04:29,062 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 115 states.
[2025-03-08 17:04:29,076 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115.
[2025-03-08 17:04:29,077 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 115 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 98 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-08 17:04:29,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions.
[2025-03-08 17:04:29,080 INFO  L78                 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 134
[2025-03-08 17:04:29,081 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 17:04:29,081 INFO  L471      AbstractCegarLoop]: Abstraction has 115 states and 171 transitions.
[2025-03-08 17:04:29,081 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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-08 17:04:29,083 INFO  L276                IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions.
[2025-03-08 17:04:29,085 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-08 17:04:29,085 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 17:04:29,085 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-08 17:04:29,092 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-03-08 17:04:29,286 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-08 17:04:29,286 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 17:04:29,287 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:04:29,287 INFO  L85        PathProgramCache]: Analyzing trace with hash 1434214049, now seen corresponding path program 1 times
[2025-03-08 17:04:29,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:04:29,287 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847011070]
[2025-03-08 17:04:29,287 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:04:29,287 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:04:29,337 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 17:04:29,357 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 17:04:29,358 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:04:29,358 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:04:29,529 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-08 17:04:29,529 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:04:29,530 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847011070]
[2025-03-08 17:04:29,530 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847011070] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:04:29,530 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:04:29,530 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 17:04:29,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567164241]
[2025-03-08 17:04:29,530 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:04:29,530 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 17:04:29,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:04:29,531 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 17:04:29,531 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 17:04:29,531 INFO  L87              Difference]: Start difference. First operand 115 states and 171 transitions. Second operand  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2025-03-08 17:04:29,570 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 17:04:29,570 INFO  L93              Difference]: Finished difference Result 229 states and 342 transitions.
[2025-03-08 17:04:29,570 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 17:04:29,570 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134
[2025-03-08 17:04:29,571 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 17:04:29,571 INFO  L225             Difference]: With dead ends: 229
[2025-03-08 17:04:29,572 INFO  L226             Difference]: Without dead ends: 117
[2025-03-08 17:04:29,572 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-08 17:04:29,573 INFO  L435           NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 17:04:29,573 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 496 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 17:04:29,573 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2025-03-08 17:04:29,584 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117.
[2025-03-08 17:04:29,585 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-08 17:04:29,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions.
[2025-03-08 17:04:29,587 INFO  L78                 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 134
[2025-03-08 17:04:29,588 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 17:04:29,588 INFO  L471      AbstractCegarLoop]: Abstraction has 117 states and 173 transitions.
[2025-03-08 17:04:29,589 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)
[2025-03-08 17:04:29,589 INFO  L276                IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions.
[2025-03-08 17:04:29,590 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-08 17:04:29,590 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 17:04:29,590 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-08 17:04:29,590 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 17:04:29,591 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 17:04:29,591 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:04:29,591 INFO  L85        PathProgramCache]: Analyzing trace with hash -166951998, now seen corresponding path program 1 times
[2025-03-08 17:04:29,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:04:29,591 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936721400]
[2025-03-08 17:04:29,591 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:04:29,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:04:29,629 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 17:04:29,675 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 17:04:29,675 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:04:29,675 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:04:29,792 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-08 17:04:29,793 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 17:04:29,793 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936721400]
[2025-03-08 17:04:29,794 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936721400] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:04:29,794 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:04:29,794 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 17:04:29,794 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200573071]
[2025-03-08 17:04:29,794 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:04:29,794 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 17:04:29,794 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 17:04:29,795 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 17:04:29,795 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 17:04:29,795 INFO  L87              Difference]: Start difference. First operand 117 states and 173 transitions. Second operand  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-08 17:04:29,825 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 17:04:29,827 INFO  L93              Difference]: Finished difference Result 234 states and 347 transitions.
[2025-03-08 17:04:29,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 17:04:29,827 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 134
[2025-03-08 17:04:29,828 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 17:04:29,829 INFO  L225             Difference]: With dead ends: 234
[2025-03-08 17:04:29,829 INFO  L226             Difference]: Without dead ends: 120
[2025-03-08 17:04:29,829 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-08 17:04:29,830 INFO  L435           NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 17:04:29,830 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 493 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 17:04:29,830 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2025-03-08 17:04:29,840 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119.
[2025-03-08 17:04:29,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 102 states have internal predecessors, (145), 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-08 17:04:29,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions.
[2025-03-08 17:04:29,843 INFO  L78                 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 134
[2025-03-08 17:04:29,843 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 17:04:29,844 INFO  L471      AbstractCegarLoop]: Abstraction has 119 states and 175 transitions.
[2025-03-08 17:04:29,845 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-08 17:04:29,845 INFO  L276                IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions.
[2025-03-08 17:04:29,846 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-08 17:04:29,846 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 17:04:29,848 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-08 17:04:29,848 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 17:04:29,848 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 17:04:29,848 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:04:29,849 INFO  L85        PathProgramCache]: Analyzing trace with hash 720551683, now seen corresponding path program 1 times
[2025-03-08 17:04:29,849 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 17:04:29,849 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562123154]
[2025-03-08 17:04:29,849 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:04:29,849 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 17:04:29,881 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 17:04:29,979 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 17:04:29,979 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:04:29,979 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 17:04:29,980 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-08 17:04:29,990 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 17:04:30,032 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 17:04:30,034 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:04:30,034 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 17:04:30,110 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-08 17:04:30,110 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-08 17:04:30,111 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 17:04:30,112 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 17:04:30,116 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2025-03-08 17:04:30,250 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 17:04:30,252 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:04:30 BoogieIcfgContainer
[2025-03-08 17:04:30,253 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 17:04:30,254 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 17:04:30,255 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 17:04:30,255 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 17:04:30,255 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:04:28" (3/4) ...
[2025-03-08 17:04:30,257 INFO  L149         WitnessPrinter]: No result that supports witness generation found
[2025-03-08 17:04:30,258 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 17:04:30,259 INFO  L158              Benchmark]: Toolchain (without parser) took 3054.94ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 43.6MB in the end (delta: 68.3MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB.
[2025-03-08 17:04:30,259 INFO  L158              Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 17:04:30,260 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 251.66ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 95.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-03-08 17:04:30,260 INFO  L158              Benchmark]: Boogie Procedure Inliner took 48.70ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 92.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 17:04:30,262 INFO  L158              Benchmark]: Boogie Preprocessor took 42.58ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 89.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2025-03-08 17:04:30,262 INFO  L158              Benchmark]: IcfgBuilder took 797.81ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 55.2MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-03-08 17:04:30,262 INFO  L158              Benchmark]: TraceAbstraction took 1903.91ms. Allocated memory is still 142.6MB. Free memory was 54.7MB in the beginning and 44.9MB in the end (delta: 9.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB.
[2025-03-08 17:04:30,262 INFO  L158              Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 142.6MB. Free memory was 44.9MB in the beginning and 43.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 17:04:30,263 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.30ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 251.66ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 95.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 48.70ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 92.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 42.58ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 89.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * IcfgBuilder took 797.81ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 55.2MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 1903.91ms. Allocated memory is still 142.6MB. Free memory was 54.7MB in the beginning and 44.9MB in the end (delta: 9.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB.
 * Witness Printer took 3.56ms. Allocated memory is still 142.6MB. Free memory was 44.9MB in the beginning and 43.6MB in the end (delta: 1.3MB). 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 122, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, 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;
             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=0, last_1_WrapperStruct00_var_1_16=43/5]
[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=1]
[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, 118 locations, 191 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, 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, 1160 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 652 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 508 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 670 NumberOfCodeBlocks, 670 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 532 ConstructedInterpolants, 0 QuantifiedInterpolants, 536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 563 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1652/1680 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2025-03-08 17:04:30,281 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-?-e2fb8be-m
[2025-03-08 17:04:32,121 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 17:04:32,203 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2025-03-08 17:04:32,222 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 17:04:32,222 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 17:04:32,268 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 17:04:32,269 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 17:04:32,270 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 17:04:32,270 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 17:04:32,271 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 17:04:32,271 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 17:04:32,271 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 17:04:32,272 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 17:04:32,272 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 17:04:32,272 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 17:04:32,272 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 17:04:32,272 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 17:04:32,273 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 17:04:32,273 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 17:04:32,273 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 17:04:32,273 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 17:04:32,273 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 17:04:32,273 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 17:04:32,273 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2025-03-08 17:04:32,273 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2025-03-08 17:04:32,273 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2025-03-08 17:04:32,273 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 17:04:32,273 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 17:04:32,273 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 17:04:32,273 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 17:04:32,274 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 17:04:32,274 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 17:04:32,274 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 17:04:32,274 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 17:04:32,274 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 17:04:32,274 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 17:04:32,275 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 17:04:32,275 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 17:04:32,275 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 17:04:32,275 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2025-03-08 17:04:32,275 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2025-03-08 17:04:32,275 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 17:04:32,275 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 17:04:32,275 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 17:04:32,275 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 17:04:32,276 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-08 17:04:32,503 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 17:04:32,508 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 17:04:32,509 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 17:04:32,511 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 17:04:32,511 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 17:04:32,512 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-08 17:04:33,615 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b081ec25/87fef03a12fb498e87601087e20652ae/FLAG8729cde30
[2025-03-08 17:04:33,845 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 17:04:33,845 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-60.i
[2025-03-08 17:04:33,855 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b081ec25/87fef03a12fb498e87601087e20652ae/FLAG8729cde30
[2025-03-08 17:04:34,175 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b081ec25/87fef03a12fb498e87601087e20652ae
[2025-03-08 17:04:34,177 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 17:04:34,178 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 17:04:34,179 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 17:04:34,179 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 17:04:34,183 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 17:04:34,184 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:04:34" (1/1) ...
[2025-03-08 17:04:34,186 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da4404c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:34, skipping insertion in model container
[2025-03-08 17:04:34,186 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:04:34" (1/1) ...
[2025-03-08 17:04:34,204 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 17:04:34,307 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-08 17:04:34,372 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 17:04:34,390 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 17:04:34,400 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-08 17:04:34,445 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 17:04:34,468 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 17:04:34,468 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:34 WrapperNode
[2025-03-08 17:04:34,469 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 17:04:34,469 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 17:04:34,469 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 17:04:34,469 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 17:04:34,473 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:34" (1/1) ...
[2025-03-08 17:04:34,483 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:34" (1/1) ...
[2025-03-08 17:04:34,506 INFO  L138                Inliner]: procedures = 37, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 517
[2025-03-08 17:04:34,506 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 17:04:34,506 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 17:04:34,506 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 17:04:34,506 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 17:04:34,512 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:34" (1/1) ...
[2025-03-08 17:04:34,513 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:34" (1/1) ...
[2025-03-08 17:04:34,519 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:34" (1/1) ...
[2025-03-08 17:04:34,544 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-08 17:04:34,544 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:34" (1/1) ...
[2025-03-08 17:04:34,544 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:34" (1/1) ...
[2025-03-08 17:04:34,556 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:34" (1/1) ...
[2025-03-08 17:04:34,557 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:34" (1/1) ...
[2025-03-08 17:04:34,560 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:34" (1/1) ...
[2025-03-08 17:04:34,561 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:34" (1/1) ...
[2025-03-08 17:04:34,564 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 17:04:34,569 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 17:04:34,569 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 17:04:34,569 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 17:04:34,570 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:34" (1/1) ...
[2025-03-08 17:04:34,573 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 17:04:34,583 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 17:04:34,595 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 17:04:34,597 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 17:04:34,614 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 17:04:34,614 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0
[2025-03-08 17:04:34,614 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1
[2025-03-08 17:04:34,614 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0
[2025-03-08 17:04:34,614 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1
[2025-03-08 17:04:34,614 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0
[2025-03-08 17:04:34,614 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1
[2025-03-08 17:04:34,614 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0
[2025-03-08 17:04:34,614 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1
[2025-03-08 17:04:34,614 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 17:04:34,615 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 17:04:34,615 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2025-03-08 17:04:34,615 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2025-03-08 17:04:34,715 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 17:04:34,716 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 17:04:43,296 INFO  L1307  $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-08 17:04:43,328 INFO  L?                        ?]: Removed 121 outVars from TransFormulas that were not future-live.
[2025-03-08 17:04:43,329 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 17:04:43,336 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 17:04:43,336 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 17:04:43,337 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:04:43 BoogieIcfgContainer
[2025-03-08 17:04:43,337 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 17:04:43,338 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 17:04:43,338 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 17:04:43,342 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 17:04:43,342 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:04:34" (1/3) ...
[2025-03-08 17:04:43,342 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316ce17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:04:43, skipping insertion in model container
[2025-03-08 17:04:43,342 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:04:34" (2/3) ...
[2025-03-08 17:04:43,343 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316ce17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:04:43, skipping insertion in model container
[2025-03-08 17:04:43,343 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:04:43" (3/3) ...
[2025-03-08 17:04:43,344 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-60.i
[2025-03-08 17:04:43,353 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 17:04:43,355 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-60.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 17:04:43,398 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 17:04:43,406 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;@274c8ea5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 17:04:43,406 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 17:04:43,409 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 118 states, 100 states have (on average 1.46) internal successors, (146), 101 states have internal predecessors, (146), 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-08 17:04:43,418 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-08 17:04:43,418 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 17:04:43,419 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-08 17:04:43,419 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 17:04:43,422 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:04:43,423 INFO  L85        PathProgramCache]: Analyzing trace with hash 1028717991, now seen corresponding path program 1 times
[2025-03-08 17:04:43,432 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 17:04:43,432 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977027796]
[2025-03-08 17:04:43,433 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:04:43,433 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 17:04:43,433 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 17:04:43,436 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 17:04:43,437 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2025-03-08 17:04:43,586 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 17:04:43,977 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 17:04:43,978 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:04:43,978 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:04:43,999 INFO  L256         TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 17:04:44,004 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 17:04:44,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked.
[2025-03-08 17:04:44,038 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 17:04:44,038 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 17:04:44,038 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977027796]
[2025-03-08 17:04:44,039 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977027796] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:04:44,039 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:04:44,039 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 17:04:44,042 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032792495]
[2025-03-08 17:04:44,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:04:44,045 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 17:04:44,046 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 17:04:44,060 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 17:04:44,061 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 17:04:44,063 INFO  L87              Difference]: Start difference. First operand  has 118 states, 100 states have (on average 1.46) internal successors, (146), 101 states have internal predecessors, (146), 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 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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-08 17:04:44,080 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 17:04:44,081 INFO  L93              Difference]: Finished difference Result 230 states and 362 transitions.
[2025-03-08 17:04:44,081 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 17:04:44,083 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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-08 17:04:44,083 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 17:04:44,087 INFO  L225             Difference]: With dead ends: 230
[2025-03-08 17:04:44,087 INFO  L226             Difference]: Without dead ends: 115
[2025-03-08 17:04:44,090 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 17:04:44,092 INFO  L435           NwaCegarLoop]: 171 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, 171 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-03-08 17:04:44,092 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-03-08 17:04:44,100 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 115 states.
[2025-03-08 17:04:44,118 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115.
[2025-03-08 17:04:44,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 115 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 98 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-08 17:04:44,124 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions.
[2025-03-08 17:04:44,125 INFO  L78                 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 134
[2025-03-08 17:04:44,125 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 17:04:44,125 INFO  L471      AbstractCegarLoop]: Abstraction has 115 states and 171 transitions.
[2025-03-08 17:04:44,125 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 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-08 17:04:44,125 INFO  L276                IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions.
[2025-03-08 17:04:44,127 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-08 17:04:44,127 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 17:04:44,127 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-08 17:04:44,145 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2025-03-08 17:04:44,328 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 17:04:44,328 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 17:04:44,329 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:04:44,329 INFO  L85        PathProgramCache]: Analyzing trace with hash 239150254, now seen corresponding path program 1 times
[2025-03-08 17:04:44,329 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 17:04:44,329 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22719766]
[2025-03-08 17:04:44,329 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:04:44,329 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 17:04:44,330 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 17:04:44,332 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 17:04:44,333 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2025-03-08 17:04:44,452 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 17:04:44,819 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 17:04:44,820 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:04:44,820 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:04:44,841 INFO  L256         TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-03-08 17:04:44,845 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 17:04:44,897 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-08 17:04:44,897 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 17:04:44,897 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 17:04:44,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22719766]
[2025-03-08 17:04:44,897 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [22719766] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:04:44,897 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:04:44,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 17:04:44,897 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994195862]
[2025-03-08 17:04:44,897 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:04:44,902 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 17:04:44,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 17:04:44,902 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 17:04:44,903 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 17:04:44,903 INFO  L87              Difference]: Start difference. First operand 115 states and 171 transitions. Second operand  has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-08 17:04:45,131 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 17:04:45,131 INFO  L93              Difference]: Finished difference Result 229 states and 342 transitions.
[2025-03-08 17:04:45,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 17:04:45,138 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-08 17:04:45,139 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 17:04:45,140 INFO  L225             Difference]: With dead ends: 229
[2025-03-08 17:04:45,140 INFO  L226             Difference]: Without dead ends: 117
[2025-03-08 17:04:45,140 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 131 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-08 17:04:45,141 INFO  L435           NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 17:04:45,141 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 496 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 17:04:45,141 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2025-03-08 17:04:45,146 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117.
[2025-03-08 17:04:45,147 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-08 17:04:45,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions.
[2025-03-08 17:04:45,148 INFO  L78                 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 134
[2025-03-08 17:04:45,148 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 17:04:45,148 INFO  L471      AbstractCegarLoop]: Abstraction has 117 states and 173 transitions.
[2025-03-08 17:04:45,149 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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-08 17:04:45,149 INFO  L276                IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions.
[2025-03-08 17:04:45,150 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-08 17:04:45,150 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 17:04:45,150 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-08 17:04:45,166 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2025-03-08 17:04:45,350 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 17:04:45,350 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 17:04:45,351 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:04:45,351 INFO  L85        PathProgramCache]: Analyzing trace with hash -198859249, now seen corresponding path program 1 times
[2025-03-08 17:04:45,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 17:04:45,352 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426693831]
[2025-03-08 17:04:45,352 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:04:45,352 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 17:04:45,352 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 17:04:45,353 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 17:04:45,355 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2025-03-08 17:04:45,489 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 17:04:45,864 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 17:04:45,864 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:04:45,864 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:04:45,884 INFO  L256         TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-08 17:04:45,893 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 17:04:45,983 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 17:04:45,984 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65
[2025-03-08 17:04:46,027 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-08 17:04:46,027 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 17:04:46,027 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 17:04:46,027 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426693831]
[2025-03-08 17:04:46,027 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [426693831] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:04:46,027 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:04:46,028 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 17:04:46,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257552065]
[2025-03-08 17:04:46,028 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:04:46,028 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 17:04:46,028 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 17:04:46,028 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 17:04:46,028 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 17:04:46,029 INFO  L87              Difference]: Start difference. First operand 117 states and 173 transitions. Second operand  has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 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-08 17:04:48,631 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:04:50,740 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:04:53,155 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 17:04:53,155 INFO  L93              Difference]: Finished difference Result 232 states and 344 transitions.
[2025-03-08 17:04:53,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 17:04:53,159 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 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 134
[2025-03-08 17:04:53,159 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 17:04:53,160 INFO  L225             Difference]: With dead ends: 232
[2025-03-08 17:04:53,160 INFO  L226             Difference]: Without dead ends: 118
[2025-03-08 17:04:53,160 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-08 17:04:53,161 INFO  L435           NwaCegarLoop]: 128 mSDtfsCounter, 166 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time
[2025-03-08 17:04:53,161 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 452 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time]
[2025-03-08 17:04:53,162 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2025-03-08 17:04:53,168 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117.
[2025-03-08 17:04:53,169 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-08 17:04:53,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions.
[2025-03-08 17:04:53,170 INFO  L78                 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 134
[2025-03-08 17:04:53,170 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 17:04:53,170 INFO  L471      AbstractCegarLoop]: Abstraction has 117 states and 172 transitions.
[2025-03-08 17:04:53,170 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 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-08 17:04:53,170 INFO  L276                IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions.
[2025-03-08 17:04:53,173 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2025-03-08 17:04:53,173 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 17:04:53,173 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-08 17:04:53,194 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2025-03-08 17:04:53,373 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 17:04:53,374 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 17:04:53,374 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:04:53,374 INFO  L85        PathProgramCache]: Analyzing trace with hash -1731324467, now seen corresponding path program 1 times
[2025-03-08 17:04:53,375 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 17:04:53,375 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390931497]
[2025-03-08 17:04:53,375 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:04:53,375 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 17:04:53,375 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 17:04:53,377 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 17:04:53,378 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2025-03-08 17:04:53,487 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-03-08 17:04:53,858 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-03-08 17:04:53,858 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:04:53,858 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:04:53,880 INFO  L256         TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-08 17:04:53,883 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 17:04:54,004 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-03-08 17:04:54,005 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65
[2025-03-08 17:04:54,037 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-08 17:04:54,037 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 17:04:54,037 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 17:04:54,037 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390931497]
[2025-03-08 17:04:54,038 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [390931497] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:04:54,041 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:04:54,041 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 17:04:54,041 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986928414]
[2025-03-08 17:04:54,041 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:04:54,041 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 17:04:54,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 17:04:54,042 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 17:04:54,042 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 17:04:54,042 INFO  L87              Difference]: Start difference. First operand 117 states and 172 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-08 17:04:55,298 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:04:56,985 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:04:58,906 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:04:59,457 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 17:04:59,458 INFO  L93              Difference]: Finished difference Result 232 states and 342 transitions.
[2025-03-08 17:04:59,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 17:04:59,462 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-08 17:04:59,462 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 17:04:59,463 INFO  L225             Difference]: With dead ends: 232
[2025-03-08 17:04:59,463 INFO  L226             Difference]: Without dead ends: 118
[2025-03-08 17:04:59,463 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-08 17:04:59,464 INFO  L435           NwaCegarLoop]: 127 mSDtfsCounter, 154 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time
[2025-03-08 17:04:59,465 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 446 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time]
[2025-03-08 17:04:59,465 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2025-03-08 17:04:59,471 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117.
[2025-03-08 17:04:59,475 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 117 states, 100 states have (on average 1.41) internal successors, (141), 100 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-08 17:04:59,475 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions.
[2025-03-08 17:04:59,475 INFO  L78                 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 136
[2025-03-08 17:04:59,476 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 17:04:59,476 INFO  L471      AbstractCegarLoop]: Abstraction has 117 states and 171 transitions.
[2025-03-08 17:04:59,476 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-08 17:04:59,476 INFO  L276                IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions.
[2025-03-08 17:04:59,477 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2025-03-08 17:04:59,478 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 17:04:59,478 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-08 17:04:59,497 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0
[2025-03-08 17:04:59,679 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 17:04:59,679 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 17:04:59,680 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:04:59,680 INFO  L85        PathProgramCache]: Analyzing trace with hash 754445071, now seen corresponding path program 1 times
[2025-03-08 17:04:59,680 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 17:04:59,680 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951499470]
[2025-03-08 17:04:59,680 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:04:59,680 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 17:04:59,680 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 17:04:59,682 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 17:04:59,683 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2025-03-08 17:04:59,791 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes.
[2025-03-08 17:05:00,178 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements.
[2025-03-08 17:05:00,178 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:05:00,178 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:05:00,200 INFO  L256         TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-08 17:05:00,203 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 17:05:00,397 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-08 17:05:00,421 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-08 17:05:00,421 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 17:05:00,421 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 17:05:00,421 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951499470]
[2025-03-08 17:05:00,421 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [951499470] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:05:00,421 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:05:00,421 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 17:05:00,421 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559494897]
[2025-03-08 17:05:00,421 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:05:00,422 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 17:05:00,422 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 17:05:00,422 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 17:05:00,422 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 17:05:00,423 INFO  L87              Difference]: Start difference. First operand 117 states and 171 transitions. Second operand  has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-08 17:05:02,726 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:05:04,666 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:05:06,637 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:05:07,040 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 17:05:07,040 INFO  L93              Difference]: Finished difference Result 232 states and 340 transitions.
[2025-03-08 17:05:07,045 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 17:05:07,045 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 138
[2025-03-08 17:05:07,045 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 17:05:07,046 INFO  L225             Difference]: With dead ends: 232
[2025-03-08 17:05:07,046 INFO  L226             Difference]: Without dead ends: 118
[2025-03-08 17:05:07,047 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 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-08 17:05:07,047 INFO  L435           NwaCegarLoop]: 126 mSDtfsCounter, 121 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time
[2025-03-08 17:05:07,047 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 441 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time]
[2025-03-08 17:05:07,048 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2025-03-08 17:05:07,054 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117.
[2025-03-08 17:05:07,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 117 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 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-08 17:05:07,055 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions.
[2025-03-08 17:05:07,055 INFO  L78                 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 138
[2025-03-08 17:05:07,055 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 17:05:07,055 INFO  L471      AbstractCegarLoop]: Abstraction has 117 states and 170 transitions.
[2025-03-08 17:05:07,055 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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-08 17:05:07,055 INFO  L276                IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions.
[2025-03-08 17:05:07,056 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2025-03-08 17:05:07,056 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 17:05:07,056 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, 1, 1]
[2025-03-08 17:05:07,074 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0
[2025-03-08 17:05:07,257 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 17:05:07,257 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 17:05:07,257 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:05:07,258 INFO  L85        PathProgramCache]: Analyzing trace with hash -877435699, now seen corresponding path program 1 times
[2025-03-08 17:05:07,258 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 17:05:07,258 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612815600]
[2025-03-08 17:05:07,258 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:05:07,258 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 17:05:07,258 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 17:05:07,260 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2025-03-08 17:05:07,260 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2025-03-08 17:05:07,366 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes.
[2025-03-08 17:05:07,738 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements.
[2025-03-08 17:05:07,738 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:05:07,738 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:05:07,760 INFO  L256         TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-03-08 17:05:07,763 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 17:05:08,005 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-08 17:05:08,028 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-08 17:05:08,028 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 17:05:08,028 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 17:05:08,029 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612815600]
[2025-03-08 17:05:08,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612815600] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 17:05:08,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 17:05:08,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 17:05:08,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858948288]
[2025-03-08 17:05:08,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 17:05:08,029 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 17:05:08,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 17:05:08,029 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 17:05:08,030 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 17:05:08,030 INFO  L87              Difference]: Start difference. First operand 117 states and 170 transitions. Second operand  has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-08 17:05:11,756 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:05:13,782 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:05:16,090 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:05:16,655 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 17:05:16,655 INFO  L93              Difference]: Finished difference Result 231 states and 337 transitions.
[2025-03-08 17:05:16,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 17:05:16,658 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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 140
[2025-03-08 17:05:16,658 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 17:05:16,658 INFO  L225             Difference]: With dead ends: 231
[2025-03-08 17:05:16,658 INFO  L226             Difference]: Without dead ends: 117
[2025-03-08 17:05:16,659 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 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-08 17:05:16,659 INFO  L435           NwaCegarLoop]: 125 mSDtfsCounter, 112 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time
[2025-03-08 17:05:16,660 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 439 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time]
[2025-03-08 17:05:16,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2025-03-08 17:05:16,663 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115.
[2025-03-08 17:05:16,663 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-08 17:05:16,667 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions.
[2025-03-08 17:05:16,667 INFO  L78                 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 140
[2025-03-08 17:05:16,667 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 17:05:16,667 INFO  L471      AbstractCegarLoop]: Abstraction has 115 states and 167 transitions.
[2025-03-08 17:05:16,667 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 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-08 17:05:16,667 INFO  L276                IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions.
[2025-03-08 17:05:16,669 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-03-08 17:05:16,669 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 17:05:16,669 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, 1, 1, 1, 1]
[2025-03-08 17:05:16,687 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-08 17:05:16,869 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-08 17:05:16,869 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 17:05:16,870 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:05:16,870 INFO  L85        PathProgramCache]: Analyzing trace with hash -1220880658, now seen corresponding path program 1 times
[2025-03-08 17:05:16,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 17:05:16,870 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709993788]
[2025-03-08 17:05:16,870 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:05:16,870 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 17:05:16,870 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 17:05:16,872 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-08 17:05:16,873 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-08 17:05:16,976 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-03-08 17:05:17,383 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-03-08 17:05:17,383 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 17:05:17,383 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 17:05:17,407 INFO  L256         TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-03-08 17:05:17,410 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 17:05:17,707 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 94 treesize of output 40
[2025-03-08 17:05:17,772 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 44 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked.
[2025-03-08 17:05:17,773 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 17:05:17,982 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 58 treesize of output 22
[2025-03-08 17:05:18,050 INFO  L134       CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked.
[2025-03-08 17:05:18,050 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2025-03-08 17:05:18,050 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709993788]
[2025-03-08 17:05:18,051 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709993788] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 17:05:18,051 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-03-08 17:05:18,051 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12
[2025-03-08 17:05:18,051 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917292629]
[2025-03-08 17:05:18,051 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-03-08 17:05:18,051 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-08 17:05:18,051 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2025-03-08 17:05:18,052 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-08 17:05:18,052 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2025-03-08 17:05:18,052 INFO  L87              Difference]: Start difference. First operand 115 states and 167 transitions. Second operand  has 12 states, 11 states have (on average 10.545454545454545) internal successors, (116), 12 states have internal predecessors, (116), 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-08 17:05:20,716 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:05:22,350 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:05:24,408 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:05:26,751 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:05:30,069 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []
[2025-03-08 17:05:30,864 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 17:05:30,864 INFO  L93              Difference]: Finished difference Result 240 states and 346 transitions.
[2025-03-08 17:05:30,869 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-03-08 17:05:30,869 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 11 states have (on average 10.545454545454545) internal successors, (116), 12 states have internal predecessors, (116), 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 142
[2025-03-08 17:05:30,869 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 17:05:30,873 INFO  L225             Difference]: With dead ends: 240
[2025-03-08 17:05:30,873 INFO  L226             Difference]: Without dead ends: 117
[2025-03-08 17:05:30,873 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462
[2025-03-08 17:05:30,873 INFO  L435           NwaCegarLoop]: 110 mSDtfsCounter, 123 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time
[2025-03-08 17:05:30,874 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 710 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time]
[2025-03-08 17:05:30,874 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2025-03-08 17:05:30,880 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115.
[2025-03-08 17:05:30,881 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-08 17:05:30,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions.
[2025-03-08 17:05:30,882 INFO  L78                 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 142
[2025-03-08 17:05:30,882 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 17:05:30,882 INFO  L471      AbstractCegarLoop]: Abstraction has 115 states and 165 transitions.
[2025-03-08 17:05:30,882 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 11 states have (on average 10.545454545454545) internal successors, (116), 12 states have internal predecessors, (116), 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-08 17:05:30,882 INFO  L276                IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions.
[2025-03-08 17:05:30,883 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-03-08 17:05:30,883 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 17:05:30,883 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, 1, 1, 1, 1]
[2025-03-08 17:05:30,902 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-08 17:05:31,084 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-08 17:05:31,084 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 17:05:31,084 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 17:05:31,084 INFO  L85        PathProgramCache]: Analyzing trace with hash -1241218033, now seen corresponding path program 1 times
[2025-03-08 17:05:31,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2025-03-08 17:05:31,085 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405983448]
[2025-03-08 17:05:31,085 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 17:05:31,085 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2025-03-08 17:05:31,085 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2025-03-08 17:05:31,087 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-08 17:05:31,087 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-08 17:05:31,212 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.