./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-48.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 6fa2cfff3f7511b3e22f25a686b235a855efe42eeda60d0ebc274a0bf286bd27 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:51:30,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:51:30,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:51:30,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:51:30,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:51:30,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:51:30,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:51:30,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:51:30,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:51:30,505 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:51:30,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:51:30,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:51:30,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:51:30,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:51:30,506 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:51:30,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:51:30,506 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:51:30,506 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:51:30,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:51:30,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:51:30,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:51:30,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:51:30,507 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:51:30,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:51:30,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:51:30,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:51:30,508 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 -> 6fa2cfff3f7511b3e22f25a686b235a855efe42eeda60d0ebc274a0bf286bd27 [2025-03-04 01:51:30,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:51:30,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:51:30,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:51:30,750 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:51:30,750 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:51:30,751 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-48.i [2025-03-04 01:51:31,858 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c29831c2/a2f40af8e4a448cea0a6cdf1c3121650/FLAGd4aad70bc [2025-03-04 01:51:32,054 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:51:32,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-48.i [2025-03-04 01:51:32,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c29831c2/a2f40af8e4a448cea0a6cdf1c3121650/FLAGd4aad70bc [2025-03-04 01:51:32,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c29831c2/a2f40af8e4a448cea0a6cdf1c3121650 [2025-03-04 01:51:32,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:51:32,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:51:32,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:51:32,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:51:32,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:51:32,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:51:32" (1/1) ... [2025-03-04 01:51:32,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ac26d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:32, skipping insertion in model container [2025-03-04 01:51:32,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:51:32" (1/1) ... [2025-03-04 01:51:32,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:51:32,531 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-48.i[917,930] [2025-03-04 01:51:32,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:51:32,607 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:51:32,616 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-48.i[917,930] [2025-03-04 01:51:32,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:51:32,682 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:51:32,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:32 WrapperNode [2025-03-04 01:51:32,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:51:32,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:51:32,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:51:32,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:51:32,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:32" (1/1) ... [2025-03-04 01:51:32,701 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:32" (1/1) ... [2025-03-04 01:51:32,738 INFO L138 Inliner]: procedures = 30, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 513 [2025-03-04 01:51:32,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:51:32,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:51:32,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:51:32,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:51:32,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:32" (1/1) ... [2025-03-04 01:51:32,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:32" (1/1) ... [2025-03-04 01:51:32,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:32" (1/1) ... [2025-03-04 01:51:32,758 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:51:32,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:32" (1/1) ... [2025-03-04 01:51:32,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:32" (1/1) ... [2025-03-04 01:51:32,770 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:32" (1/1) ... [2025-03-04 01:51:32,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:32" (1/1) ... [2025-03-04 01:51:32,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:32" (1/1) ... [2025-03-04 01:51:32,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:32" (1/1) ... [2025-03-04 01:51:32,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:51:32,785 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:51:32,785 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:51:32,785 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:51:32,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:32" (1/1) ... [2025-03-04 01:51:32,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:51:32,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:51:32,817 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-04 01:51:32,820 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-04 01:51:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:51:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:51:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:51:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:51:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:51:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:51:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:51:32,838 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:51:32,838 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:51:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:51:32,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:51:32,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:51:32,940 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:51:32,942 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:51:33,479 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L154: havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite108#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite105#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~mem109#1;havoc property_#t~ite123#1;havoc property_#t~ite122#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem119#1;havoc property_#t~short124#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite133#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~short140#1;havoc property_#t~mem141#1;havoc property_#t~short142#1; [2025-03-04 01:51:33,513 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-04 01:51:33,514 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:51:33,526 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:51:33,526 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:51:33,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:51:33 BoogieIcfgContainer [2025-03-04 01:51:33,527 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:51:33,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:51:33,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:51:33,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:51:33,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:51:32" (1/3) ... [2025-03-04 01:51:33,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f951a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:51:33, skipping insertion in model container [2025-03-04 01:51:33,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:32" (2/3) ... [2025-03-04 01:51:33,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f951a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:51:33, skipping insertion in model container [2025-03-04 01:51:33,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:51:33" (3/3) ... [2025-03-04 01:51:33,533 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-48.i [2025-03-04 01:51:33,542 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:51:33,543 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-48.i that has 2 procedures, 117 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:51:33,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:51:33,588 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;@709210c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:51:33,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:51:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:51:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:51:33,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:33,601 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:51:33,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:33,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:33,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1892011575, now seen corresponding path program 1 times [2025-03-04 01:51:33,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:51:33,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692602729] [2025-03-04 01:51:33,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:33,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:51:33,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:51:33,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:51:33,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:33,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-04 01:51:33,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:51:33,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692602729] [2025-03-04 01:51:33,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692602729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:51:33,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640543009] [2025-03-04 01:51:33,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:33,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:51:33,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:51:33,984 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-04 01:51:33,985 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-04 01:51:34,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:51:34,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:51:34,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:34,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:34,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:51:34,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-04 01:51:34,292 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:34,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640543009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:34,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:51:34,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:51:34,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492011971] [2025-03-04 01:51:34,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:34,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:51:34,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:51:34,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:51:34,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:51:34,315 INFO L87 Difference]: Start difference. First operand has 117 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:51:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:34,335 INFO L93 Difference]: Finished difference Result 228 states and 358 transitions. [2025-03-04 01:51:34,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:51:34,336 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-03-04 01:51:34,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:34,342 INFO L225 Difference]: With dead ends: 228 [2025-03-04 01:51:34,342 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 01:51:34,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-04 01:51:34,348 INFO L435 NwaCegarLoop]: 164 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, 164 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-04 01:51:34,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:51:34,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 01:51:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-04 01:51:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:51:34,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-03-04 01:51:34,379 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 168 [2025-03-04 01:51:34,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:34,380 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-03-04 01:51:34,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:51:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-03-04 01:51:34,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:51:34,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:34,382 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:51:34,389 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-04 01:51:34,583 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-04 01:51:34,584 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:34,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:34,584 INFO L85 PathProgramCache]: Analyzing trace with hash 803660678, now seen corresponding path program 1 times [2025-03-04 01:51:34,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:51:34,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773850598] [2025-03-04 01:51:34,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:34,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:51:34,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:51:34,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:51:34,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:34,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:51:34,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:51:34,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773850598] [2025-03-04 01:51:34,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773850598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:34,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:34,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:51:34,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975769171] [2025-03-04 01:51:34,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:34,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:51:34,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:51:34,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:51:34,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:51:34,913 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:51:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:34,949 INFO L93 Difference]: Finished difference Result 228 states and 329 transitions. [2025-03-04 01:51:34,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:51:34,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:51:34,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:34,954 INFO L225 Difference]: With dead ends: 228 [2025-03-04 01:51:34,955 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 01:51:34,956 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-04 01:51:34,958 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 472 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-04 01:51:34,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 472 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:51:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 01:51:34,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2025-03-04 01:51:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:51:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2025-03-04 01:51:34,975 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 168 [2025-03-04 01:51:34,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:34,976 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2025-03-04 01:51:34,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:51:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2025-03-04 01:51:34,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:51:34,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:34,977 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:51:34,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:51:34,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:34,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:34,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1003793785, now seen corresponding path program 1 times [2025-03-04 01:51:34,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:51:34,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699374346] [2025-03-04 01:51:34,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:34,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:51:35,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:51:35,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:51:35,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:35,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:51:35,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:51:35,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699374346] [2025-03-04 01:51:35,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699374346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:35,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:35,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:51:35,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531259101] [2025-03-04 01:51:35,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:35,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:51:35,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:51:35,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:51:35,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:51:35,191 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:51:35,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:35,221 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2025-03-04 01:51:35,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:51:35,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:51:35,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:35,228 INFO L225 Difference]: With dead ends: 232 [2025-03-04 01:51:35,229 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 01:51:35,229 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-04 01:51:35,230 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:35,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 473 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:51:35,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 01:51:35,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-03-04 01:51:35,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:51:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2025-03-04 01:51:35,241 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 168 [2025-03-04 01:51:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:35,242 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2025-03-04 01:51:35,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:51:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2025-03-04 01:51:35,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:51:35,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:35,244 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:51:35,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:51:35,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:35,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:35,244 INFO L85 PathProgramCache]: Analyzing trace with hash -116290104, now seen corresponding path program 1 times [2025-03-04 01:51:35,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:51:35,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018812881] [2025-03-04 01:51:35,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:35,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:51:35,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:51:35,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:51:35,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:35,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:51:35,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:51:35,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018812881] [2025-03-04 01:51:35,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018812881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:35,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:35,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:51:35,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690870468] [2025-03-04 01:51:35,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:35,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:51:35,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:51:35,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:51:35,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:51:35,434 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:51:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:35,459 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2025-03-04 01:51:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:51:35,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:51:35,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:35,462 INFO L225 Difference]: With dead ends: 236 [2025-03-04 01:51:35,462 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 01:51:35,463 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-04 01:51:35,464 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:35,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:51:35,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 01:51:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-03-04 01:51:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 97 states have internal predecessors, (128), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:51:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2025-03-04 01:51:35,475 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 168 [2025-03-04 01:51:35,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:35,475 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2025-03-04 01:51:35,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:51:35,476 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2025-03-04 01:51:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:51:35,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:35,477 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:51:35,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:51:35,477 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:35,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash -115366583, now seen corresponding path program 1 times [2025-03-04 01:51:35,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:51:35,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998736244] [2025-03-04 01:51:35,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:35,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:51:35,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:51:35,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:51:35,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:35,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:51:36,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:51:36,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998736244] [2025-03-04 01:51:36,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998736244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:36,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:36,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:51:36,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707946235] [2025-03-04 01:51:36,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:36,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:51:36,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:51:36,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:51:36,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:51:36,547 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:51:36,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:36,584 INFO L93 Difference]: Finished difference Result 237 states and 337 transitions. [2025-03-04 01:51:36,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:51:36,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:51:36,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:36,586 INFO L225 Difference]: With dead ends: 237 [2025-03-04 01:51:36,586 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 01:51:36,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:51:36,587 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 99 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:36,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 314 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:51:36,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 01:51:36,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-04 01:51:36,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.309278350515464) internal successors, (127), 97 states have internal predecessors, (127), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:51:36,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2025-03-04 01:51:36,599 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 168 [2025-03-04 01:51:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:36,599 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2025-03-04 01:51:36,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:51:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2025-03-04 01:51:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:51:36,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:36,603 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:51:36,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:51:36,603 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:36,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash -959838454, now seen corresponding path program 1 times [2025-03-04 01:51:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:51:36,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335486562] [2025-03-04 01:51:36,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:36,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:51:36,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:51:36,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:51:36,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:36,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:51:36,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:51:36,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:51:36,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:51:36,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:36,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:51:36,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:51:36,999 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:51:37,001 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:51:37,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:51:37,004 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 01:51:37,176 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:51:37,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:51:37 BoogieIcfgContainer [2025-03-04 01:51:37,181 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:51:37,182 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:51:37,182 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:51:37,182 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:51:37,183 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:51:33" (3/4) ... [2025-03-04 01:51:37,184 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:51:37,185 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:51:37,186 INFO L158 Benchmark]: Toolchain (without parser) took 4765.18ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 105.7MB in the beginning and 231.5MB in the end (delta: -125.7MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2025-03-04 01:51:37,186 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 201.3MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:51:37,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.19ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 88.2MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:51:37,187 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.39ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 84.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:51:37,187 INFO L158 Benchmark]: Boogie Preprocessor took 44.83ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 80.8MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:51:37,188 INFO L158 Benchmark]: IcfgBuilder took 741.88ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 44.4MB in the end (delta: 36.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:51:37,188 INFO L158 Benchmark]: TraceAbstraction took 3653.53ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 43.4MB in the beginning and 231.5MB in the end (delta: -188.1MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. [2025-03-04 01:51:37,188 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 343.9MB. Free memory was 231.5MB in the beginning and 231.5MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:51:37,189 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.44ms. Allocated memory is still 201.3MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.19ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 88.2MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.39ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 84.3MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.83ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 80.8MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 741.88ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 44.4MB in the end (delta: 36.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3653.53ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 43.4MB in the beginning and 231.5MB in the end (delta: -188.1MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 343.9MB. Free memory was 231.5MB in the beginning and 231.5MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 88. Possible FailurePath: [L43] unsigned char isInitial = 0; [L44-L64] struct WrapperStruct00 WrapperStruct00 = { 32.8, 255.675, 5.5, 128.75, 4.5, 9.25, 5, 200, 8, 4, 100, 64, 1, 200, 2, 0, 1, 64, 100 }; [L65] float* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L66] float* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L67] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L68] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L69] float* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L70] float* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L71] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L72] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L73] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L74] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L75] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L76] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L77] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L78] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L79] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L80] unsigned char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L81] unsigned long int* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); [L82] signed long int* WrapperStruct00_var_1_21_Pointer = &(WrapperStruct00.var_1_21); [L83] unsigned char* WrapperStruct00_var_1_22_Pointer = &(WrapperStruct00.var_1_22); [L84] unsigned char last_1_WrapperStruct00_var_1_7 = 5; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=0, last_1_WrapperStruct00_var_1_7=5] [L158] isInitial = 1 [L159] FCALL initially() [L160] COND TRUE 1 [L161] CALL updateLastVariables() [L151] EXPR WrapperStruct00.var_1_7 [L151] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L161] RET updateLastVariables() [L162] CALL updateVariables() [L115] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L116] EXPR WrapperStruct00.var_1_2 [L116] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L116] EXPR WrapperStruct00.var_1_2 [L116] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L116] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L116] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L116] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L117] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L118] EXPR WrapperStruct00.var_1_3 [L118] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L118] EXPR WrapperStruct00.var_1_3 [L118] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L118] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L118] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L118] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L119] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L120] EXPR WrapperStruct00.var_1_4 [L120] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L120] EXPR WrapperStruct00.var_1_4 [L120] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L120] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L120] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L120] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L121] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L122] EXPR WrapperStruct00.var_1_5 [L122] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L122] EXPR WrapperStruct00.var_1_5 [L122] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L122] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L122] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L122] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L123] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L124] EXPR WrapperStruct00.var_1_6 [L124] EXPR WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F [L124] EXPR WrapperStruct00.var_1_6 [L124] EXPR WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L124] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L124] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L124] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L125] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L126] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 190) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 190) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L127] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L128] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L129] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L130] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L131] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L132] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L132] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L132] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L133] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L133] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L133] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L134] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L135] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L135] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L135] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L136] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L136] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L136] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L137] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L138] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L138] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L138] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L139] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L139] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L139] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L140] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L141] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L141] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 191) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L141] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 191) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L142] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L142] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L142] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L143] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L144] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L144] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L144] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L145] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L145] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L145] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L146] WrapperStruct00.var_1_19 = __VERIFIER_nondet_uchar() [L147] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L147] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L147] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L148] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L148] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L148] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L162] RET updateVariables() [L163] CALL step() [L88] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L88] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer)) <= (*(WrapperStruct00_var_1_3_Pointer))) [L95] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L95] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L97] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L97] (*(WrapperStruct00_var_1_20_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L98] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L98] (*(WrapperStruct00_var_1_21_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L99] (*(WrapperStruct00_var_1_22_Pointer)) = 4 [L100] EXPR \read(*WrapperStruct00_var_1_21_Pointer) [L100] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_21_Pointer)); [L101] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L101] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L101] EXPR \read(*WrapperStruct00_var_1_18_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5, stepLocal_0=191] [L101] COND FALSE !((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (8 + (*(WrapperStruct00_var_1_18_Pointer)))) > stepLocal_0) [L104] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L104] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L106] EXPR \read(*WrapperStruct00_var_1_16_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L106] COND FALSE !((*(WrapperStruct00_var_1_16_Pointer))) [L163] RET step() [L164] CALL, EXPR property() [L154] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L154] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L154] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) <= (*(WrapperStruct00_var_1_3_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) < (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + 1.395f)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer)))) [L154] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L154] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L154] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) <= (*(WrapperStruct00_var_1_3_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) < (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + 1.395f)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L154] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) <= (*(WrapperStruct00_var_1_3_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) < (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + 1.395f)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) - (*(WrapperStruct00_var_1_12_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L154] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) <= (*(WrapperStruct00_var_1_3_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) < (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + 1.395f)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) - (*(WrapperStruct00_var_1_12_Pointer))))))) : 1)) && (((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (8 + (*(WrapperStruct00_var_1_18_Pointer)))) > (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_19_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L154] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) <= (*(WrapperStruct00_var_1_3_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) < (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + 1.395f)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) - (*(WrapperStruct00_var_1_12_Pointer))))))) : 1)) && (((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (8 + (*(WrapperStruct00_var_1_18_Pointer)))) > (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_19_Pointer)))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L154] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) <= (*(WrapperStruct00_var_1_3_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) < (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + 1.395f)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) - (*(WrapperStruct00_var_1_12_Pointer))))))) : 1)) && (((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (8 + (*(WrapperStruct00_var_1_18_Pointer)))) > (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_19_Pointer)))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_17_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L154] EXPR (((((((*(WrapperStruct00_var_1_2_Pointer)) <= (*(WrapperStruct00_var_1_3_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) < (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + 1.395f)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) - (*(WrapperStruct00_var_1_12_Pointer))))))) : 1)) && (((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (8 + (*(WrapperStruct00_var_1_18_Pointer)))) > (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_19_Pointer)))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_17_Pointer))))) && ((*(WrapperStruct00_var_1_22_Pointer)) == ((unsigned char) 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L154-L155] return (((((((*(WrapperStruct00_var_1_2_Pointer)) <= (*(WrapperStruct00_var_1_3_Pointer))) ? (((*(WrapperStruct00_var_1_3_Pointer)) < (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + 1.395f)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) ? ((last_1_WrapperStruct00_var_1_7 != last_1_WrapperStruct00_var_1_7) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) - ((((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) - (*(WrapperStruct00_var_1_12_Pointer))))))) : 1)) && (((((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_12_Pointer))) - (8 + (*(WrapperStruct00_var_1_18_Pointer)))) > (*(WrapperStruct00_var_1_21_Pointer))) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_19_Pointer)))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_21_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_17_Pointer))))) && ((*(WrapperStruct00_var_1_22_Pointer)) == ((unsigned char) 4)) ; [L164] RET, EXPR property() [L164] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:25}, WrapperStruct00_var_1_12_Pointer={4:26}, WrapperStruct00_var_1_13_Pointer={4:27}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:31}, WrapperStruct00_var_1_18_Pointer={4:32}, WrapperStruct00_var_1_19_Pointer={4:33}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:34}, WrapperStruct00_var_1_21_Pointer={4:38}, WrapperStruct00_var_1_22_Pointer={4:42}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, isInitial=1, last_1_WrapperStruct00_var_1_7=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 1898 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1093 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 805 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=4, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1176 NumberOfCodeBlocks, 1176 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1002 ConstructedInterpolants, 0 QuantifiedInterpolants, 2164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 694 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 5000/5040 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-04 01:51:37,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-48.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 6fa2cfff3f7511b3e22f25a686b235a855efe42eeda60d0ebc274a0bf286bd27 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:51:39,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:51:39,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:51:39,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:51:39,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:51:39,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:51:39,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:51:39,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:51:39,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:51:39,136 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:51:39,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:51:39,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:51:39,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:51:39,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:51:39,137 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:51:39,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:51:39,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:51:39,137 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:51:39,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:51:39,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:51:39,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:51:39,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:51:39,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:51:39,137 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:51:39,137 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:51:39,137 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:51:39,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:51:39,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:51:39,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:51:39,138 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 -> 6fa2cfff3f7511b3e22f25a686b235a855efe42eeda60d0ebc274a0bf286bd27 [2025-03-04 01:51:39,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:51:39,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:51:39,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:51:39,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:51:39,377 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:51:39,377 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-48.i [2025-03-04 01:51:40,510 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8321c60bf/d453e0b2ed9f4dd49fe905b6ecfca741/FLAG2e1005666 [2025-03-04 01:51:40,706 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:51:40,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-48.i [2025-03-04 01:51:40,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8321c60bf/d453e0b2ed9f4dd49fe905b6ecfca741/FLAG2e1005666 [2025-03-04 01:51:41,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8321c60bf/d453e0b2ed9f4dd49fe905b6ecfca741 [2025-03-04 01:51:41,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:51:41,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:51:41,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:51:41,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:51:41,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:51:41,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:51:41" (1/1) ... [2025-03-04 01:51:41,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57268e34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:41, skipping insertion in model container [2025-03-04 01:51:41,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:51:41" (1/1) ... [2025-03-04 01:51:41,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:51:41,177 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-48.i[917,930] [2025-03-04 01:51:41,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:51:41,227 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:51:41,236 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-48.i[917,930] [2025-03-04 01:51:41,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:51:41,288 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:51:41,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:41 WrapperNode [2025-03-04 01:51:41,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:51:41,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:51:41,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:51:41,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:51:41,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:41" (1/1) ... [2025-03-04 01:51:41,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:41" (1/1) ... [2025-03-04 01:51:41,341 INFO L138 Inliner]: procedures = 34, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2025-03-04 01:51:41,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:51:41,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:51:41,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:51:41,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:51:41,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:41" (1/1) ... [2025-03-04 01:51:41,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:41" (1/1) ... [2025-03-04 01:51:41,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:41" (1/1) ... [2025-03-04 01:51:41,386 INFO L175 MemorySlicer]: Split 144 memory accesses to 2 slices as follows [2, 142]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 43 writes are split as follows [0, 43]. [2025-03-04 01:51:41,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:41" (1/1) ... [2025-03-04 01:51:41,387 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:41" (1/1) ... [2025-03-04 01:51:41,407 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:41" (1/1) ... [2025-03-04 01:51:41,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:41" (1/1) ... [2025-03-04 01:51:41,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:41" (1/1) ... [2025-03-04 01:51:41,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:41" (1/1) ... [2025-03-04 01:51:41,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:51:41,415 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:51:41,415 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:51:41,415 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:51:41,416 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:41" (1/1) ... [2025-03-04 01:51:41,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:51:41,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:51:41,447 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-04 01:51:41,453 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-04 01:51:41,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:51:41,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:51:41,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:51:41,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:51:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:51:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:51:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:51:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:51:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:51:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 01:51:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 01:51:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:51:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:51:41,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:51:41,471 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:51:41,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:51:41,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:51:41,593 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:51:41,595 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:51:43,954 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L154: havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite108#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite105#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~mem109#1;havoc property_#t~ite123#1;havoc property_#t~ite122#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem119#1;havoc property_#t~short124#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite133#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~short140#1;havoc property_#t~mem141#1;havoc property_#t~short142#1; [2025-03-04 01:51:43,992 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-04 01:51:43,992 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:51:44,000 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:51:44,001 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:51:44,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:51:44 BoogieIcfgContainer [2025-03-04 01:51:44,002 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:51:44,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:51:44,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:51:44,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:51:44,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:51:41" (1/3) ... [2025-03-04 01:51:44,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c02a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:51:44, skipping insertion in model container [2025-03-04 01:51:44,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:51:41" (2/3) ... [2025-03-04 01:51:44,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c02a5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:51:44, skipping insertion in model container [2025-03-04 01:51:44,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:51:44" (3/3) ... [2025-03-04 01:51:44,009 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-48.i [2025-03-04 01:51:44,020 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:51:44,022 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-48.i that has 2 procedures, 117 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:51:44,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:51:44,070 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;@73ff2192, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:51:44,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:51:44,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:51:44,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:51:44,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:44,086 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:51:44,087 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:44,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:44,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2069252283, now seen corresponding path program 1 times [2025-03-04 01:51:44,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:44,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011620106] [2025-03-04 01:51:44,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:44,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:51:44,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:44,101 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-04 01:51:44,102 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-04 01:51:44,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:51:44,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:51:44,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:44,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:44,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:51:44,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:44,506 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-03-04 01:51:44,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:44,508 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:51:44,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011620106] [2025-03-04 01:51:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011620106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:44,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:44,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:51:44,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530921592] [2025-03-04 01:51:44,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:44,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:51:44,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:51:44,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:51:44,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:51:44,531 INFO L87 Difference]: Start difference. First operand has 117 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:51:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:44,557 INFO L93 Difference]: Finished difference Result 228 states and 358 transitions. [2025-03-04 01:51:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:51:44,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-03-04 01:51:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:44,566 INFO L225 Difference]: With dead ends: 228 [2025-03-04 01:51:44,567 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 01:51:44,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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-04 01:51:44,573 INFO L435 NwaCegarLoop]: 164 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, 164 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-04 01:51:44,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:51:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 01:51:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-04 01:51:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:51:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-03-04 01:51:44,614 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 168 [2025-03-04 01:51:44,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:44,614 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-03-04 01:51:44,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:51:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-03-04 01:51:44,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:51:44,618 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:44,618 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:51:44,628 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-04 01:51:44,819 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-04 01:51:44,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:44,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:44,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1137364116, now seen corresponding path program 1 times [2025-03-04 01:51:44,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:44,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888333901] [2025-03-04 01:51:44,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:44,822 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-04 01:51:44,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:44,824 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-04 01:51:44,826 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-04 01:51:44,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:51:45,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:51:45,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:45,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:45,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:51:45,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:51:45,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:45,195 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:51:45,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888333901] [2025-03-04 01:51:45,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888333901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:45,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:45,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:51:45,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28684407] [2025-03-04 01:51:45,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:45,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:51:45,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:51:45,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:51:45,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:51:45,197 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:51:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:45,267 INFO L93 Difference]: Finished difference Result 230 states and 332 transitions. [2025-03-04 01:51:45,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:51:45,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:51:45,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:45,274 INFO L225 Difference]: With dead ends: 230 [2025-03-04 01:51:45,274 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 01:51:45,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:51:45,275 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:45,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 620 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:51:45,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 01:51:45,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-03-04 01:51:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:51:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2025-03-04 01:51:45,294 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 168 [2025-03-04 01:51:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:45,295 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2025-03-04 01:51:45,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:51:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2025-03-04 01:51:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:51:45,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:45,296 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:51:45,308 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-04 01:51:45,497 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-04 01:51:45,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:45,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:45,497 INFO L85 PathProgramCache]: Analyzing trace with hash -670090347, now seen corresponding path program 1 times [2025-03-04 01:51:45,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:45,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469855742] [2025-03-04 01:51:45,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:45,498 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-04 01:51:45,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:45,501 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-04 01:51:45,502 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-04 01:51:45,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:51:45,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:51:45,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:45,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:45,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:51:45,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:45,846 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:51:45,846 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:45,846 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:51:45,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469855742] [2025-03-04 01:51:45,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469855742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:45,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:45,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:51:45,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196616299] [2025-03-04 01:51:45,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:45,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:51:45,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:51:45,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:51:45,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:51:45,847 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:51:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:45,916 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2025-03-04 01:51:45,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:51:45,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:51:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:45,920 INFO L225 Difference]: With dead ends: 236 [2025-03-04 01:51:45,920 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 01:51:45,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:51:45,921 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:45,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 765 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:51:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 01:51:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-03-04 01:51:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 97 states have internal predecessors, (128), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:51:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2025-03-04 01:51:45,933 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 168 [2025-03-04 01:51:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:45,934 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2025-03-04 01:51:45,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:51:45,934 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2025-03-04 01:51:45,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:51:45,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:45,936 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:51:45,947 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-04 01:51:46,136 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-04 01:51:46,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:46,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:46,137 INFO L85 PathProgramCache]: Analyzing trace with hash 217413334, now seen corresponding path program 1 times [2025-03-04 01:51:46,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:46,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632841485] [2025-03-04 01:51:46,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:46,138 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-04 01:51:46,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:46,139 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-04 01:51:46,140 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-04 01:51:46,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:51:46,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:51:46,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:46,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:46,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:51:46,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:51:46,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:46,483 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:51:46,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632841485] [2025-03-04 01:51:46,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632841485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:46,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:46,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:51:46,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730562272] [2025-03-04 01:51:46,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:46,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:51:46,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:51:46,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:51:46,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:51:46,485 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:51:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:46,551 INFO L93 Difference]: Finished difference Result 240 states and 341 transitions. [2025-03-04 01:51:46,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:51:46,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-03-04 01:51:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:46,553 INFO L225 Difference]: With dead ends: 240 [2025-03-04 01:51:46,553 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 01:51:46,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:51:46,554 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:46,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 911 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:51:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 01:51:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-03-04 01:51:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:51:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 172 transitions. [2025-03-04 01:51:46,566 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 172 transitions. Word has length 168 [2025-03-04 01:51:46,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:46,566 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 172 transitions. [2025-03-04 01:51:46,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:51:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 172 transitions. [2025-03-04 01:51:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 01:51:46,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:46,568 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:51:46,578 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-04 01:51:46,769 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-04 01:51:46,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:46,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:46,770 INFO L85 PathProgramCache]: Analyzing trace with hash 218336855, now seen corresponding path program 1 times [2025-03-04 01:51:46,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:46,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607942565] [2025-03-04 01:51:46,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:46,770 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-04 01:51:46,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:46,772 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-04 01:51:46,773 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-04 01:51:46,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 01:51:47,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 01:51:47,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:47,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:47,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:51:47,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:47,192 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-04 01:51:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-03-04 01:51:47,223 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:47,223 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:51:47,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607942565] [2025-03-04 01:51:47,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607942565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:47,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:47,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:51:47,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788322118] [2025-03-04 01:51:47,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:47,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:51:47,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:51:47,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:51:47,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:51:47,225 INFO L87 Difference]: Start difference. First operand 122 states and 172 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:51:48,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:51:49,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:49,995 INFO L93 Difference]: Finished difference Result 242 states and 342 transitions. [2025-03-04 01:51:49,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:51:49,997 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-03-04 01:51:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:49,997 INFO L225 Difference]: With dead ends: 242 [2025-03-04 01:51:49,997 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 01:51:49,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 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-04 01:51:49,998 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 143 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:49,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 463 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-04 01:51:49,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 01:51:50,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-03-04 01:51:50,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.303030303030303) internal successors, (129), 99 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:51:50,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2025-03-04 01:51:50,007 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 168 [2025-03-04 01:51:50,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:50,007 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2025-03-04 01:51:50,007 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:51:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2025-03-04 01:51:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 01:51:50,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:50,011 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:51:50,021 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-04 01:51:50,211 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-04 01:51:50,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:50,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:50,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1185822923, now seen corresponding path program 1 times [2025-03-04 01:51:50,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:50,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174532463] [2025-03-04 01:51:50,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:50,213 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-04 01:51:50,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:50,214 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-04 01:51:50,215 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-04 01:51:50,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 01:51:50,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 01:51:50,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:50,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:50,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:51:50,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:50,594 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-04 01:51:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2025-03-04 01:51:50,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:50,623 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:51:50,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174532463] [2025-03-04 01:51:50,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174532463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:50,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:50,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:51:50,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984816678] [2025-03-04 01:51:50,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:50,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:51:50,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:51:50,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:51:50,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:51:50,626 INFO L87 Difference]: Start difference. First operand 122 states and 171 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:51:52,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:51:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:54,276 INFO L93 Difference]: Finished difference Result 242 states and 340 transitions. [2025-03-04 01:51:54,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:51:54,277 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 170 [2025-03-04 01:51:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:54,278 INFO L225 Difference]: With dead ends: 242 [2025-03-04 01:51:54,278 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 01:51:54,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:51:54,279 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 135 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:54,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 461 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-04 01:51:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 01:51:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-03-04 01:51:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:51:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 170 transitions. [2025-03-04 01:51:54,288 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 170 transitions. Word has length 170 [2025-03-04 01:51:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:54,288 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 170 transitions. [2025-03-04 01:51:54,289 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, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:51:54,289 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 170 transitions. [2025-03-04 01:51:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 01:51:54,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:54,290 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:51:54,301 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-04 01:51:54,490 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-04 01:51:54,490 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:54,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:54,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1648282392, now seen corresponding path program 1 times [2025-03-04 01:51:54,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:54,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902379941] [2025-03-04 01:51:54,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:54,491 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-04 01:51:54,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:54,493 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-04 01:51:54,494 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-04 01:51:54,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 01:51:54,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 01:51:54,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:54,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:54,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:51:54,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:51:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-03-04 01:51:54,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:51:54,782 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:51:54,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902379941] [2025-03-04 01:51:54,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902379941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:51:54,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:51:54,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:51:54,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717453800] [2025-03-04 01:51:54,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:51:54,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:51:54,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:51:54,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:51:54,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:51:54,785 INFO L87 Difference]: Start difference. First operand 122 states and 170 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 01:51:54,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:51:54,960 INFO L93 Difference]: Finished difference Result 245 states and 342 transitions. [2025-03-04 01:51:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:51:54,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 172 [2025-03-04 01:51:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:51:54,961 INFO L225 Difference]: With dead ends: 245 [2025-03-04 01:51:54,961 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 01:51:54,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:51:54,962 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:51:54,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 639 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:51:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 01:51:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2025-03-04 01:51:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.2828282828282829) internal successors, (127), 99 states have internal predecessors, (127), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:51:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 169 transitions. [2025-03-04 01:51:54,968 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 169 transitions. Word has length 172 [2025-03-04 01:51:54,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:51:54,968 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 169 transitions. [2025-03-04 01:51:54,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 01:51:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 169 transitions. [2025-03-04 01:51:54,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 01:51:54,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:51:54,969 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:51:54,978 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-04 01:51:55,169 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-04 01:51:55,169 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:51:55,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:51:55,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1198678057, now seen corresponding path program 1 times [2025-03-04 01:51:55,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:51:55,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070932198] [2025-03-04 01:51:55,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:51:55,170 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-04 01:51:55,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:51:55,172 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-04 01:51:55,173 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-04 01:51:55,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 01:51:55,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 01:51:55,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:51:55,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:51:55,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:51:55,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:52:01,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:52:01,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2025-03-04 01:52:01,651 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2025-03-04 01:52:01,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 60 [2025-03-04 01:52:01,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:52:01,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 48 [2025-03-04 01:52:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:52:01,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:52:02,148 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_502 (_ BitVec 32)) (v_ArrVal_499 (_ BitVec 32)) (v_ArrVal_498 (_ BitVec 32)) (v_ArrVal_501 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_498)))) (store (store (store .cse0 c_~WrapperStruct00_var_1_20_Pointer~0.base v_ArrVal_501) c_~WrapperStruct00_var_1_21_Pointer~0.base v_ArrVal_500) c_~WrapperStruct00_var_1_22_Pointer~0.base (store (select (let ((.cse1 (store .cse0 c_~WrapperStruct00_var_1_20_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_20_Pointer~0.base) c_~WrapperStruct00_var_1_20_Pointer~0.offset v_ArrVal_499)))) (store .cse1 c_~WrapperStruct00_var_1_21_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_21_Pointer~0.base) c_~WrapperStruct00_var_1_21_Pointer~0.offset v_ArrVal_502))) c_~WrapperStruct00_var_1_22_Pointer~0.base) c_~WrapperStruct00_var_1_22_Pointer~0.offset ((_ sign_extend 24) (_ bv4 8))))) c_~WrapperStruct00_var_1_19_Pointer~0.base) c_~WrapperStruct00_var_1_19_Pointer~0.offset)))) is different from false [2025-03-04 01:52:02,336 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:52:02,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070932198] [2025-03-04 01:52:02,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070932198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:52:02,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [631099955] [2025-03-04 01:52:02,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:02,336 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:52:02,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:52:02,338 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:52:02,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-04 01:52:02,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 01:52:03,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 01:52:03,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:03,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:03,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 01:52:03,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:52:08,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:52:08,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:52:09,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2025-03-04 01:52:09,129 INFO L349 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2025-03-04 01:52:09,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 60 [2025-03-04 01:52:09,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:52:09,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 48 [2025-03-04 01:52:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-04 01:52:09,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:52:15,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [631099955] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:52:15,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:52:15,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2025-03-04 01:52:15,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212428967] [2025-03-04 01:52:15,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:52:15,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 01:52:15,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:52:15,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 01:52:15,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=673, Unknown=31, NotChecked=54, Total=870 [2025-03-04 01:52:15,194 INFO L87 Difference]: Start difference. First operand 122 states and 169 transitions. Second operand has 21 states, 19 states have (on average 6.7894736842105265) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-03-04 01:52:19,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:52:21,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:52:24,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:52:26,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:52:27,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:52:29,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:52:32,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:52:34,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:52:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:52:42,078 INFO L93 Difference]: Finished difference Result 355 states and 491 transitions. [2025-03-04 01:52:42,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:52:42,078 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.7894736842105265) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 172 [2025-03-04 01:52:42,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:52:42,080 INFO L225 Difference]: With dead ends: 355 [2025-03-04 01:52:42,080 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 01:52:42,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=292, Invalid=1321, Unknown=31, NotChecked=78, Total=1722 [2025-03-04 01:52:42,081 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 569 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 191 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:52:42,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 631 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1313 Invalid, 1 Unknown, 0 Unchecked, 25.4s Time] [2025-03-04 01:52:42,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 01:52:42,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 226. [2025-03-04 01:52:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 183 states have (on average 1.278688524590164) internal successors, (234), 184 states have internal predecessors, (234), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:52:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 314 transitions. [2025-03-04 01:52:42,103 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 314 transitions. Word has length 172 [2025-03-04 01:52:42,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:52:42,103 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 314 transitions. [2025-03-04 01:52:42,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.7894736842105265) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-03-04 01:52:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 314 transitions. [2025-03-04 01:52:42,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-04 01:52:42,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:52:42,104 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:52:42,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-04 01:52:42,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-04 01:52:42,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:52:42,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:52:42,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:52:42,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2043149928, now seen corresponding path program 1 times [2025-03-04 01:52:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:52:42,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552436997] [2025-03-04 01:52:42,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:52:42,506 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-04 01:52:42,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:52:42,508 INFO L229 MonitoredProcess]: Starting monitored process 11 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-04 01:52:42,509 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 (11)] Waiting until timeout for monitored process [2025-03-04 01:52:42,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-04 01:52:42,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-04 01:52:42,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:52:42,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:52:42,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-04 01:52:42,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:52:46,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:52:48,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2025-03-04 01:52:50,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2025-03-04 01:52:51,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2025-03-04 01:52:53,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 40 [2025-03-04 01:52:55,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2025-03-04 01:52:56,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 54 [2025-03-04 01:52:58,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 62 [2025-03-04 01:53:00,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 65 [2025-03-04 01:53:02,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 92 [2025-03-04 01:53:03,173 INFO L349 Elim1Store]: treesize reduction 137, result has 17.5 percent of original size [2025-03-04 01:53:03,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 133 [2025-03-04 01:53:03,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 110 [2025-03-04 01:53:04,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:53:04,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 217 treesize of output 101 [2025-03-04 01:53:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 304 proven. 392 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:53:04,256 INFO L312 TraceCheckSpWp]: Computing backward predicates...