./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.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 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:06:58,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:06:58,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:06:58,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:06:58,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:06:58,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:06:58,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:06:58,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:06:58,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:06:58,955 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:06:58,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:06:58,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:06:58,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:06:58,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:06:58,956 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:06:58,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:06:58,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:06:58,957 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:06:58,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:06:58,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:06:58,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:06:58,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:06:58,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:06:58,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:06:58,957 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:06:58,958 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:06:58,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:06:58,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:06:58,958 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 -> 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 [2025-03-17 06:06:59,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:06:59,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:06:59,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:06:59,191 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:06:59,192 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:06:59,193 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-28.i [2025-03-17 06:07:00,343 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10721e49/bf73564e72834785bfec17409cb49da2/FLAG9a08c5c0d [2025-03-17 06:07:00,635 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:07:00,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i [2025-03-17 06:07:00,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10721e49/bf73564e72834785bfec17409cb49da2/FLAG9a08c5c0d [2025-03-17 06:07:00,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10721e49/bf73564e72834785bfec17409cb49da2 [2025-03-17 06:07:00,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:07:00,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:07:00,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:07:00,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:07:00,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:07:00,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:07:00" (1/1) ... [2025-03-17 06:07:00,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30eec23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:00, skipping insertion in model container [2025-03-17 06:07:00,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:07:00" (1/1) ... [2025-03-17 06:07:00,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:07:01,048 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-28.i[917,930] [2025-03-17 06:07:01,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:07:01,100 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:07:01,108 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-28.i[917,930] [2025-03-17 06:07:01,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:07:01,163 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:07:01,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:01 WrapperNode [2025-03-17 06:07:01,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:07:01,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:07:01,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:07:01,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:07:01,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:01" (1/1) ... [2025-03-17 06:07:01,181 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:01" (1/1) ... [2025-03-17 06:07:01,202 INFO L138 Inliner]: procedures = 30, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 587 [2025-03-17 06:07:01,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:07:01,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:07:01,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:07:01,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:07:01,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:01" (1/1) ... [2025-03-17 06:07:01,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:01" (1/1) ... [2025-03-17 06:07:01,212 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:01" (1/1) ... [2025-03-17 06:07:01,221 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:07:01,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:01" (1/1) ... [2025-03-17 06:07:01,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:01" (1/1) ... [2025-03-17 06:07:01,234 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:01" (1/1) ... [2025-03-17 06:07:01,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:01" (1/1) ... [2025-03-17 06:07:01,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:01" (1/1) ... [2025-03-17 06:07:01,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:01" (1/1) ... [2025-03-17 06:07:01,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:07:01,244 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:07:01,244 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:07:01,244 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:07:01,245 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:01" (1/1) ... [2025-03-17 06:07:01,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:07:01,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:07:01,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:07:01,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:07:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:07:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:07:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:07:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:07:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:07:01,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:07:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:07:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:07:01,294 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:07:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:07:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:07:01,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:07:01,399 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:07:01,400 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:07:01,846 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L122: havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem111#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem115#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short123#1;havoc property_#t~mem129#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~short130#1;havoc property_#t~mem131#1;havoc property_#t~bitwise132#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~ite137#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite159#1;havoc property_#t~mem150#1;havoc property_#t~mem140#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~ite144#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~mem149#1;havoc property_#t~mem145#1;havoc property_#t~ite148#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~mem158#1;havoc property_#t~mem157#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem156#1;havoc property_#t~short160#1;havoc property_#t~mem162#1;havoc property_#t~mem161#1;havoc property_#t~short163#1;havoc property_#t~mem165#1;havoc property_#t~mem164#1;havoc property_#t~short166#1; [2025-03-17 06:07:01,884 INFO L? ?]: Removed 170 outVars from TransFormulas that were not future-live. [2025-03-17 06:07:01,884 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:07:01,904 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:07:01,904 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:07:01,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:07:01 BoogieIcfgContainer [2025-03-17 06:07:01,904 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:07:01,906 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:07:01,906 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:07:01,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:07:01,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:07:00" (1/3) ... [2025-03-17 06:07:01,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa6e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:07:01, skipping insertion in model container [2025-03-17 06:07:01,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:01" (2/3) ... [2025-03-17 06:07:01,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa6e27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:07:01, skipping insertion in model container [2025-03-17 06:07:01,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:07:01" (3/3) ... [2025-03-17 06:07:01,912 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-28.i [2025-03-17 06:07:01,923 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:07:01,924 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-28.i that has 2 procedures, 117 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:07:01,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:07:01,977 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;@30f08b9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:07:01,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:07:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 100 states have (on average 1.45) internal successors, (145), 101 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:07:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 06:07:01,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:01,992 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:01,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:01,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:01,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2045380044, now seen corresponding path program 1 times [2025-03-17 06:07:02,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:02,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784780620] [2025-03-17 06:07:02,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:02,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:02,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 06:07:02,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 06:07:02,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:02,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:07:02,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:02,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784780620] [2025-03-17 06:07:02,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784780620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:02,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:02,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:07:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490484635] [2025-03-17 06:07:02,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:02,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:07:02,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:02,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:07:02,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:07:02,601 INFO L87 Difference]: Start difference. First operand has 117 states, 100 states have (on average 1.45) internal successors, (145), 101 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:02,674 INFO L93 Difference]: Finished difference Result 234 states and 362 transitions. [2025-03-17 06:07:02,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:07:02,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126 [2025-03-17 06:07:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:02,684 INFO L225 Difference]: With dead ends: 234 [2025-03-17 06:07:02,684 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 06:07:02,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:07:02,691 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:02,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:07:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 06:07:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-17 06:07:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:07:02,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2025-03-17 06:07:02,728 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 126 [2025-03-17 06:07:02,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:02,729 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2025-03-17 06:07:02,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2025-03-17 06:07:02,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 06:07:02,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:02,731 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:02,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:07:02,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:02,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:02,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1362083571, now seen corresponding path program 1 times [2025-03-17 06:07:02,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:02,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135434832] [2025-03-17 06:07:02,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:02,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:02,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 06:07:02,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 06:07:02,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:02,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:07:03,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:03,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135434832] [2025-03-17 06:07:03,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135434832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:03,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:03,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:07:03,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590407109] [2025-03-17 06:07:03,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:03,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:07:03,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:03,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:07:03,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:07:03,047 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:03,085 INFO L93 Difference]: Finished difference Result 236 states and 341 transitions. [2025-03-17 06:07:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:07:03,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126 [2025-03-17 06:07:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:03,088 INFO L225 Difference]: With dead ends: 236 [2025-03-17 06:07:03,088 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 06:07:03,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:07:03,089 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:03,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 478 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:07:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 06:07:03,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-17 06:07:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:07:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2025-03-17 06:07:03,103 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 126 [2025-03-17 06:07:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:03,104 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2025-03-17 06:07:03,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2025-03-17 06:07:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 06:07:03,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:03,106 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:03,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:07:03,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:03,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1361160050, now seen corresponding path program 1 times [2025-03-17 06:07:03,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:03,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601934709] [2025-03-17 06:07:03,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:03,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 06:07:03,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 06:07:03,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:03,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:07:08,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:08,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601934709] [2025-03-17 06:07:08,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601934709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:08,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:08,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:07:08,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782019031] [2025-03-17 06:07:08,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:08,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:07:08,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:08,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:07:08,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:07:08,274 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-17 06:07:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:09,950 INFO L93 Difference]: Finished difference Result 397 states and 571 transitions. [2025-03-17 06:07:09,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:07:09,951 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 126 [2025-03-17 06:07:09,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:09,954 INFO L225 Difference]: With dead ends: 397 [2025-03-17 06:07:09,955 INFO L226 Difference]: Without dead ends: 279 [2025-03-17 06:07:09,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:07:09,956 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 481 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:09,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1165 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 06:07:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-17 06:07:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 149. [2025-03-17 06:07:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 128 states have (on average 1.3828125) internal successors, (177), 129 states have internal predecessors, (177), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:07:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 213 transitions. [2025-03-17 06:07:09,986 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 213 transitions. Word has length 126 [2025-03-17 06:07:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:09,987 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 213 transitions. [2025-03-17 06:07:09,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-17 06:07:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 213 transitions. [2025-03-17 06:07:09,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 06:07:09,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:09,988 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:09,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:07:09,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:09,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:09,989 INFO L85 PathProgramCache]: Analyzing trace with hash -567888816, now seen corresponding path program 1 times [2025-03-17 06:07:09,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:09,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517335449] [2025-03-17 06:07:09,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:09,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:10,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 06:07:10,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 06:07:10,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:10,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:07:10,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:10,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517335449] [2025-03-17 06:07:10,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517335449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:10,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:10,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:07:10,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950323546] [2025-03-17 06:07:10,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:10,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:07:10,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:10,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:07:10,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:07:10,473 INFO L87 Difference]: Start difference. First operand 149 states and 213 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:10,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:10,761 INFO L93 Difference]: Finished difference Result 336 states and 478 transitions. [2025-03-17 06:07:10,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:07:10,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 128 [2025-03-17 06:07:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:10,764 INFO L225 Difference]: With dead ends: 336 [2025-03-17 06:07:10,764 INFO L226 Difference]: Without dead ends: 210 [2025-03-17 06:07:10,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:07:10,765 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 253 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:10,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 527 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:07:10,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-17 06:07:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 168. [2025-03-17 06:07:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 147 states have (on average 1.380952380952381) internal successors, (203), 148 states have internal predecessors, (203), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:07:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 239 transitions. [2025-03-17 06:07:10,788 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 239 transitions. Word has length 128 [2025-03-17 06:07:10,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:10,788 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 239 transitions. [2025-03-17 06:07:10,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 239 transitions. [2025-03-17 06:07:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:07:10,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:10,793 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:10,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:07:10,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:10,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:10,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2045093646, now seen corresponding path program 1 times [2025-03-17 06:07:10,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:10,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133774166] [2025-03-17 06:07:10,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:10,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:10,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:07:10,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:07:10,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:10,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:07:11,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:07:11,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133774166] [2025-03-17 06:07:11,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133774166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:11,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:11,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:07:11,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759162995] [2025-03-17 06:07:11,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:11,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:07:11,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:07:11,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:07:11,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:07:11,016 INFO L87 Difference]: Start difference. First operand 168 states and 239 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:11,133 INFO L93 Difference]: Finished difference Result 313 states and 446 transitions. [2025-03-17 06:07:11,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:07:11,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-03-17 06:07:11,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:11,136 INFO L225 Difference]: With dead ends: 313 [2025-03-17 06:07:11,137 INFO L226 Difference]: Without dead ends: 168 [2025-03-17 06:07:11,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:07:11,138 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:11,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:07:11,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-17 06:07:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-17 06:07:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 147 states have (on average 1.3673469387755102) internal successors, (201), 148 states have internal predecessors, (201), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:07:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 237 transitions. [2025-03-17 06:07:11,156 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 237 transitions. Word has length 130 [2025-03-17 06:07:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:11,157 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 237 transitions. [2025-03-17 06:07:11,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 237 transitions. [2025-03-17 06:07:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:07:11,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:11,159 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:11,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:07:11,160 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:11,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1252801297, now seen corresponding path program 1 times [2025-03-17 06:07:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:07:11,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976559605] [2025-03-17 06:07:11,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:11,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:07:11,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:07:11,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:07:11,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:11,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:07:11,293 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:07:11,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:07:11,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:07:11,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:11,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:07:11,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:07:11,552 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:07:11,553 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:07:11,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:07:11,557 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 06:07:11,672 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:07:11,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:07:11 BoogieIcfgContainer [2025-03-17 06:07:11,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:07:11,677 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:07:11,677 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:07:11,678 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:07:11,678 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:07:01" (3/4) ... [2025-03-17 06:07:11,680 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:07:11,680 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:07:11,682 INFO L158 Benchmark]: Toolchain (without parser) took 10746.83ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 120.7MB in the beginning and 399.2MB in the end (delta: -278.5MB). Peak memory consumption was 133.2MB. Max. memory is 16.1GB. [2025-03-17 06:07:11,682 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:07:11,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.79ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 105.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:07:11,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.44ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 101.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:07:11,683 INFO L158 Benchmark]: Boogie Preprocessor took 37.50ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 98.6MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:07:11,684 INFO L158 Benchmark]: IcfgBuilder took 660.01ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 60.1MB in the end (delta: 38.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:07:11,684 INFO L158 Benchmark]: TraceAbstraction took 9770.93ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 59.1MB in the beginning and 399.3MB in the end (delta: -340.3MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. [2025-03-17 06:07:11,684 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 578.8MB. Free memory was 399.3MB in the beginning and 399.2MB in the end (delta: 99.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:07:11,685 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.20ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.79ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 105.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.44ms. Allocated memory is still 167.8MB. Free memory was 105.0MB in the beginning and 101.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.50ms. Allocated memory is still 167.8MB. Free memory was 101.0MB in the beginning and 98.6MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 660.01ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 60.1MB in the end (delta: 38.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9770.93ms. Allocated memory was 167.8MB in the beginning and 578.8MB in the end (delta: 411.0MB). Free memory was 59.1MB in the beginning and 399.3MB in the end (delta: -340.3MB). Peak memory consumption was 74.5MB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 578.8MB. Free memory was 399.3MB in the beginning and 399.2MB in the end (delta: 99.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 111. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 1, 63.75, 255.75, 10, 4, -10, 4.75, 99.5, 255.9, 24.85, -2, 1629954775, 1928642731, 0, 5 }; [L57] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L58] float* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L59] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L60] signed char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L61] signed char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L62] signed char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L63] float* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L64] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L65] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L66] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L67] signed long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L68] signed long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L69] signed long int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L70] signed short int* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L71] unsigned short int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] FCALL updateLastVariables() [L130] CALL updateVariables() [L95] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L96] EXPR (WrapperStruct00.var_1_2 >= 0.0F && 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_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && 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_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && 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_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L97] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_3 >= 0.0F && 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_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && 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_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && 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_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L99] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L102] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L105] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L106] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L108] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L109] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L110] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L111] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_long() [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L115] WrapperStruct00.var_1_15 = __VERIFIER_nondet_long() [L116] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L130] RET updateVariables() [L131] CALL step() [L75] signed long int stepLocal_0 = -4; [L76] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, stepLocal_0=-4] [L76] COND TRUE stepLocal_0 < (*(WrapperStruct00_var_1_6_Pointer)) [L77] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L77] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) [L77] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L77] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L77] (*(WrapperStruct00_var_1_8_Pointer)) = (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))) [L79] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L79] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) [L79] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L79] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L79] (*(WrapperStruct00_var_1_11_Pointer)) = (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))) [L80] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L80] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_5_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L81] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L82] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L82] COND TRUE ((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer))) [L83] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L83] EXPR ((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))) [L83] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L83] EXPR ((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L83] (*(WrapperStruct00_var_1_1_Pointer)) = ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))) [L87] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L87] EXPR (*(WrapperStruct00_var_1_6_Pointer)) | 5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L87] signed long int stepLocal_1 = (*(WrapperStruct00_var_1_6_Pointer)) | 5; [L88] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, stepLocal_1=5] [L88] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))) [L88] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L88] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1, stepLocal_1=5] [L88] COND FALSE !(stepLocal_1 <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) [L91] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L91] EXPR (((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L91] EXPR (((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L91] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L91] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))) [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer)))) [L122] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L122] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L122] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR (((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122] EXPR ((((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L122-L123] return ((((((((*(WrapperStruct00_var_1_2_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) <= (- (*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((((((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) < ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_5_Pointer)) - (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((-4 < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer)))))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) | 5) <= (((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_6_Pointer))) < (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : (((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_19_Pointer)))))) - ((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_5_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_6_Pointer)) + ((((((*(WrapperStruct00_var_1_19_Pointer))) < ((*(WrapperStruct00_var_1_19_Pointer)))) ? ((*(WrapperStruct00_var_1_19_Pointer))) : ((*(WrapperStruct00_var_1_19_Pointer))))) - (*(WrapperStruct00_var_1_19_Pointer)))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:24}, WrapperStruct00_var_1_12_Pointer={4:28}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_15_Pointer={4:36}, WrapperStruct00_var_1_18_Pointer={4:40}, WrapperStruct00_var_1_19_Pointer={4:42}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:16}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 187 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 737 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 736 mSDsluCounter, 2913 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2135 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1751 IncrementalHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 778 mSDtfsCounter, 1751 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=4, InterpolantAutomatonStates: 29, 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, 174 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 766 NumberOfCodeBlocks, 766 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 6965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1820/1820 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 06:07:11,703 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-28.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 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:07:13,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:07:13,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:07:13,685 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:07:13,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:07:13,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:07:13,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:07:13,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:07:13,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:07:13,701 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:07:13,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:07:13,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:07:13,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:07:13,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:07:13,702 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:07:13,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:07:13,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:07:13,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:07:13,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:07:13,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:07:13,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:07:13,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:07:13,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:07:13,704 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:07:13,704 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:07:13,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:07:13,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:07:13,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:07:13,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:07:13,704 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 -> 2c73545d06247c76a19bfff914dc0c2540d1446dabb109d0b7af2557e2972c70 [2025-03-17 06:07:13,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:07:13,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:07:13,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:07:13,950 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:07:13,951 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:07:13,952 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-28.i [2025-03-17 06:07:15,133 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d10154a/0bb49cf30a7f499f8d2ed07de0ebc7b4/FLAG487a3fe5f [2025-03-17 06:07:15,333 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:07:15,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-28.i [2025-03-17 06:07:15,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d10154a/0bb49cf30a7f499f8d2ed07de0ebc7b4/FLAG487a3fe5f [2025-03-17 06:07:15,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d10154a/0bb49cf30a7f499f8d2ed07de0ebc7b4 [2025-03-17 06:07:15,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:07:15,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:07:15,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:07:15,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:07:15,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:07:15,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:07:15" (1/1) ... [2025-03-17 06:07:15,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359b79e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:15, skipping insertion in model container [2025-03-17 06:07:15,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:07:15" (1/1) ... [2025-03-17 06:07:15,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:07:15,827 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-28.i[917,930] [2025-03-17 06:07:15,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:07:15,884 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:07:15,892 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-28.i[917,930] [2025-03-17 06:07:15,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:07:15,964 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:07:15,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:15 WrapperNode [2025-03-17 06:07:15,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:07:15,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:07:15,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:07:15,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:07:15,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:15" (1/1) ... [2025-03-17 06:07:15,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:15" (1/1) ... [2025-03-17 06:07:16,024 INFO L138 Inliner]: procedures = 37, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 564 [2025-03-17 06:07:16,024 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:07:16,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:07:16,025 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:07:16,025 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:07:16,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:15" (1/1) ... [2025-03-17 06:07:16,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:15" (1/1) ... [2025-03-17 06:07:16,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:15" (1/1) ... [2025-03-17 06:07:16,071 INFO L175 MemorySlicer]: Split 153 memory accesses to 2 slices as follows [2, 151]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-03-17 06:07:16,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:15" (1/1) ... [2025-03-17 06:07:16,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:15" (1/1) ... [2025-03-17 06:07:16,088 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:15" (1/1) ... [2025-03-17 06:07:16,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:15" (1/1) ... [2025-03-17 06:07:16,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:15" (1/1) ... [2025-03-17 06:07:16,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:15" (1/1) ... [2025-03-17 06:07:16,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:07:16,103 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:07:16,103 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:07:16,103 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:07:16,104 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:15" (1/1) ... [2025-03-17 06:07:16,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:07:16,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:07:16,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:07:16,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:07:16,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:07:16,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:07:16,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:07:16,155 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:07:16,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:07:16,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:07:16,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:07:16,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:07:16,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:07:16,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:07:16,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:07:16,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:07:16,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 06:07:16,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 06:07:16,283 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:07:16,284 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:07:17,539 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L122: havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite113#1;havoc property_#t~mem110#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite109#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~ite121#1;havoc property_#t~mem120#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~short122#1;havoc property_#t~mem128#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short129#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~ite135#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~ite157#1;havoc property_#t~mem148#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~ite142#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~mem147#1;havoc property_#t~mem143#1;havoc property_#t~ite146#1;havoc property_#t~mem144#1;havoc property_#t~mem145#1;havoc property_#t~mem156#1;havoc property_#t~mem155#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~ite153#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~mem154#1;havoc property_#t~short158#1;havoc property_#t~mem160#1;havoc property_#t~mem159#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1; [2025-03-17 06:07:17,578 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2025-03-17 06:07:17,578 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:07:17,586 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:07:17,586 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:07:17,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:07:17 BoogieIcfgContainer [2025-03-17 06:07:17,587 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:07:17,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:07:17,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:07:17,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:07:17,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:07:15" (1/3) ... [2025-03-17 06:07:17,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f43610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:07:17, skipping insertion in model container [2025-03-17 06:07:17,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:07:15" (2/3) ... [2025-03-17 06:07:17,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f43610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:07:17, skipping insertion in model container [2025-03-17 06:07:17,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:07:17" (3/3) ... [2025-03-17 06:07:17,595 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-28.i [2025-03-17 06:07:17,604 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:07:17,605 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-28.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:07:17,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:07:17,670 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;@274eb84a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:07:17,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:07:17,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 93 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:07:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:07:17,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:17,684 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:17,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:17,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:17,690 INFO L85 PathProgramCache]: Analyzing trace with hash 908272885, now seen corresponding path program 1 times [2025-03-17 06:07:17,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:07:17,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297323995] [2025-03-17 06:07:17,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:17,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:17,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:07:17,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:07:17,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 06:07:17,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:07:18,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:07:18,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:18,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:18,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:07:18,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-17 06:07:18,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:07:18,077 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:07:18,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297323995] [2025-03-17 06:07:18,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297323995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:18,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:18,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:07:18,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620385912] [2025-03-17 06:07:18,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:18,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:07:18,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:07:18,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:07:18,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:07:18,102 INFO L87 Difference]: Start difference. First operand has 109 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 93 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:07:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:18,127 INFO L93 Difference]: Finished difference Result 215 states and 334 transitions. [2025-03-17 06:07:18,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:07:18,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 124 [2025-03-17 06:07:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:18,133 INFO L225 Difference]: With dead ends: 215 [2025-03-17 06:07:18,133 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 06:07:18,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:07:18,136 INFO L435 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:18,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:07:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 06:07:18,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-17 06:07:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:07:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2025-03-17 06:07:18,162 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 124 [2025-03-17 06:07:18,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:18,162 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 157 transitions. [2025-03-17 06:07:18,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:07:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 157 transitions. [2025-03-17 06:07:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:07:18,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:18,165 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:18,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 06:07:18,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:18,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:18,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:18,367 INFO L85 PathProgramCache]: Analyzing trace with hash -806999509, now seen corresponding path program 1 times [2025-03-17 06:07:18,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:07:18,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097201463] [2025-03-17 06:07:18,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:18,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:18,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:07:18,369 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:07:18,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 06:07:18,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:07:18,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:07:18,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:18,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:18,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:07:18,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:18,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 06:07:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:07:18,785 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:07:18,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:07:18,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097201463] [2025-03-17 06:07:18,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097201463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:18,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:18,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:07:18,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670095266] [2025-03-17 06:07:18,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:18,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:07:18,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:07:18,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:07:18,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:07:18,787 INFO L87 Difference]: Start difference. First operand 107 states and 157 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:18,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:18,819 INFO L93 Difference]: Finished difference Result 213 states and 313 transitions. [2025-03-17 06:07:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:07:18,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2025-03-17 06:07:18,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:18,822 INFO L225 Difference]: With dead ends: 213 [2025-03-17 06:07:18,822 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 06:07:18,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:07:18,823 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:18,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:07:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 06:07:18,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-17 06:07:18,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 91 states have internal predecessors, (128), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:07:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2025-03-17 06:07:18,831 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 124 [2025-03-17 06:07:18,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:18,834 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2025-03-17 06:07:18,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2025-03-17 06:07:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:07:18,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:18,837 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:18,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 06:07:19,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:19,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:19,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:19,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1804071862, now seen corresponding path program 1 times [2025-03-17 06:07:19,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:07:19,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643056180] [2025-03-17 06:07:19,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:19,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:19,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:07:19,041 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:07:19,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 06:07:19,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:07:19,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:07:19,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:19,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:19,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:07:19,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:07:19,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:07:19,404 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:07:19,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643056180] [2025-03-17 06:07:19,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643056180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:19,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:19,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:07:19,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336774044] [2025-03-17 06:07:19,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:19,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:07:19,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:07:19,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:07:19,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:07:19,406 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:19,470 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2025-03-17 06:07:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:07:19,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2025-03-17 06:07:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:19,472 INFO L225 Difference]: With dead ends: 220 [2025-03-17 06:07:19,472 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 06:07:19,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 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-17 06:07:19,473 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:19,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 724 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:07:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 06:07:19,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-17 06:07:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 97 states have internal predecessors, (134), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:07:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 162 transitions. [2025-03-17 06:07:19,480 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 162 transitions. Word has length 124 [2025-03-17 06:07:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:19,480 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 162 transitions. [2025-03-17 06:07:19,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2025-03-17 06:07:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:07:19,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:19,482 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:19,493 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-17 06:07:19,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:19,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:19,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:19,684 INFO L85 PathProgramCache]: Analyzing trace with hash -916568181, now seen corresponding path program 1 times [2025-03-17 06:07:19,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:07:19,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154131945] [2025-03-17 06:07:19,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:19,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:19,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:07:19,687 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:07:19,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 06:07:19,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:07:19,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:07:19,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:19,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:20,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:07:20,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:07:20,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:07:20,043 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:07:20,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154131945] [2025-03-17 06:07:20,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154131945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:20,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:20,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:07:20,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529519501] [2025-03-17 06:07:20,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:20,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:07:20,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:07:20,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:07:20,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:07:20,044 INFO L87 Difference]: Start difference. First operand 113 states and 162 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:20,120 INFO L93 Difference]: Finished difference Result 228 states and 327 transitions. [2025-03-17 06:07:20,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:07:20,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2025-03-17 06:07:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:20,125 INFO L225 Difference]: With dead ends: 228 [2025-03-17 06:07:20,126 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 06:07:20,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 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-17 06:07:20,127 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:20,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 862 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:07:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 06:07:20,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-17 06:07:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:07:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2025-03-17 06:07:20,135 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 124 [2025-03-17 06:07:20,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:20,135 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2025-03-17 06:07:20,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:20,136 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2025-03-17 06:07:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:07:20,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:20,139 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:20,150 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 (5)] Forceful destruction successful, exit code 0 [2025-03-17 06:07:20,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:20,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:20,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:20,340 INFO L85 PathProgramCache]: Analyzing trace with hash -915644660, now seen corresponding path program 1 times [2025-03-17 06:07:20,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:07:20,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055082068] [2025-03-17 06:07:20,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:20,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:20,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:07:20,343 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:07:20,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 06:07:20,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:07:20,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:07:20,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:20,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:20,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:07:20,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:20,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 06:07:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:07:20,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:07:20,730 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:07:20,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055082068] [2025-03-17 06:07:20,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055082068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:20,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:20,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:07:20,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798627582] [2025-03-17 06:07:20,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:20,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:07:20,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:07:20,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:07:20,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:07:20,731 INFO L87 Difference]: Start difference. First operand 115 states and 164 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:22,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:07:23,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:23,523 INFO L93 Difference]: Finished difference Result 230 states and 328 transitions. [2025-03-17 06:07:23,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:07:23,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2025-03-17 06:07:23,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:23,524 INFO L225 Difference]: With dead ends: 230 [2025-03-17 06:07:23,524 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 06:07:23,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:07:23,525 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 153 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:23,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 442 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-17 06:07:23,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 06:07:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-17 06:07:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:07:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2025-03-17 06:07:23,533 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 124 [2025-03-17 06:07:23,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:23,533 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2025-03-17 06:07:23,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:07:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2025-03-17 06:07:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-17 06:07:23,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:23,534 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:23,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 06:07:23,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:23,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:23,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:23,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1382307694, now seen corresponding path program 1 times [2025-03-17 06:07:23,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:07:23,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374394919] [2025-03-17 06:07:23,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:23,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:23,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:07:23,737 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:07:23,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 06:07:23,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-17 06:07:24,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-17 06:07:24,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:24,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:24,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:07:24,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:24,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 06:07:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-17 06:07:24,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:07:24,145 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:07:24,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374394919] [2025-03-17 06:07:24,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374394919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:07:24,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:07:24,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:07:24,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316415365] [2025-03-17 06:07:24,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:07:24,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:07:24,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:07:24,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:07:24,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:07:24,148 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:07:25,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:07:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:26,021 INFO L93 Difference]: Finished difference Result 230 states and 326 transitions. [2025-03-17 06:07:26,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:07:26,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 126 [2025-03-17 06:07:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:26,022 INFO L225 Difference]: With dead ends: 230 [2025-03-17 06:07:26,022 INFO L226 Difference]: Without dead ends: 116 [2025-03-17 06:07:26,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 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-17 06:07:26,023 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 142 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:26,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 437 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 06:07:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-17 06:07:26,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2025-03-17 06:07:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:07:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 162 transitions. [2025-03-17 06:07:26,034 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 162 transitions. Word has length 126 [2025-03-17 06:07:26,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:26,034 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 162 transitions. [2025-03-17 06:07:26,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:07:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 162 transitions. [2025-03-17 06:07:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 06:07:26,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:26,035 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:26,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 06:07:26,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:26,236 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:26,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:26,236 INFO L85 PathProgramCache]: Analyzing trace with hash -282359668, now seen corresponding path program 1 times [2025-03-17 06:07:26,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:07:26,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238279818] [2025-03-17 06:07:26,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:26,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:26,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:07:26,239 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:07:26,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 06:07:26,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 06:07:26,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 06:07:26,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:26,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:26,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 06:07:26,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:27,016 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 12 treesize of output 8 [2025-03-17 06:07:27,358 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 30 treesize of output 25 [2025-03-17 06:07:27,653 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 41 treesize of output 28 [2025-03-17 06:07:27,861 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 41 treesize of output 28 [2025-03-17 06:07:28,079 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 41 treesize of output 28 [2025-03-17 06:07:28,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:07:28,309 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 1 case distinctions, treesize of input 41 treesize of output 28 [2025-03-17 06:07:28,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:07:28,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2025-03-17 06:07:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 159 proven. 117 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-17 06:07:28,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:07:28,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:07:28,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238279818] [2025-03-17 06:07:28,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238279818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:07:28,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [185808441] [2025-03-17 06:07:28,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:28,614 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 06:07:28,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 06:07:28,637 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 06:07:28,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-17 06:07:28,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 06:07:30,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 06:07:30,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:30,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:30,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 06:07:30,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:30,504 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 12 treesize of output 8 [2025-03-17 06:07:30,877 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 30 treesize of output 25 [2025-03-17 06:07:31,144 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 32 treesize of output 23 [2025-03-17 06:07:31,302 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 32 treesize of output 23 [2025-03-17 06:07:31,442 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 32 treesize of output 23 [2025-03-17 06:07:31,637 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 32 treesize of output 23 [2025-03-17 06:07:31,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 06:07:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 159 proven. 117 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-17 06:07:31,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:07:31,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [185808441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:07:31,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:07:31,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-17 06:07:31,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337400244] [2025-03-17 06:07:31,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:07:31,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 06:07:31,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:07:31,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 06:07:31,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-03-17 06:07:31,906 INFO L87 Difference]: Start difference. First operand 115 states and 162 transitions. Second operand has 19 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 16 states have internal predecessors, (120), 10 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 8 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-17 06:07:33,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:07:36,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:07:38,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:07:40,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:07:42,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:07:45,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:07:45,456 INFO L93 Difference]: Finished difference Result 260 states and 359 transitions. [2025-03-17 06:07:45,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 06:07:45,458 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 16 states have internal predecessors, (120), 10 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 8 states have call predecessors, (28), 10 states have call successors, (28) Word has length 128 [2025-03-17 06:07:45,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:07:45,459 INFO L225 Difference]: With dead ends: 260 [2025-03-17 06:07:45,459 INFO L226 Difference]: Without dead ends: 146 [2025-03-17 06:07:45,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2025-03-17 06:07:45,460 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 172 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:07:45,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 542 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 13.3s Time] [2025-03-17 06:07:45,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-17 06:07:45,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2025-03-17 06:07:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 123 states have internal predecessors, (160), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:07:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 196 transitions. [2025-03-17 06:07:45,480 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 196 transitions. Word has length 128 [2025-03-17 06:07:45,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:07:45,480 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 196 transitions. [2025-03-17 06:07:45,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 16 states have internal predecessors, (120), 10 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 8 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-17 06:07:45,480 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 196 transitions. [2025-03-17 06:07:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 06:07:45,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:07:45,481 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:07:45,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-03-17 06:07:45,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 06:07:45,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:45,882 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:07:45,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:07:45,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2072917006, now seen corresponding path program 1 times [2025-03-17 06:07:45,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:07:45,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786900995] [2025-03-17 06:07:45,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:07:45,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:07:45,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:07:45,885 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:07:45,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-17 06:07:45,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 06:07:46,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 06:07:46,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:07:46,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:07:46,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 06:07:46,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:07:47,946 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 12 treesize of output 8 [2025-03-17 06:07:48,979 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 30 treesize of output 25 [2025-03-17 06:07:49,915 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 38 treesize of output 36 [2025-03-17 06:07:50,887 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 40 treesize of output 34 [2025-03-17 06:07:51,550 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 40 treesize of output 34 [2025-03-17 06:07:52,207 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 40 treesize of output 34 [2025-03-17 06:07:53,048 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 40 treesize of output 34 [2025-03-17 06:07:54,030 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 40 treesize of output 34 [2025-03-17 06:07:54,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 74 [2025-03-17 06:07:54,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 43 [2025-03-17 06:07:54,291 INFO L349 Elim1Store]: treesize reduction 53, result has 18.5 percent of original size [2025-03-17 06:07:54,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 123 treesize of output 130 [2025-03-17 06:07:54,351 INFO L349 Elim1Store]: treesize reduction 101, result has 8.2 percent of original size [2025-03-17 06:07:54,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 101 treesize of output 199 [2025-03-17 06:07:54,978 INFO L349 Elim1Store]: treesize reduction 44, result has 26.7 percent of original size [2025-03-17 06:07:54,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 78 [2025-03-17 06:07:55,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2025-03-17 06:07:55,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2025-03-17 06:07:55,478 INFO L349 Elim1Store]: treesize reduction 124, result has 20.0 percent of original size [2025-03-17 06:07:55,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 300 treesize of output 240 [2025-03-17 06:08:20,275 WARN L286 SmtUtils]: Spent 20.05s on a formula simplification. DAG size of input: 1298 DAG size of output: 725 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-17 06:08:20,275 INFO L349 Elim1Store]: treesize reduction 1296, result has 52.3 percent of original size [2025-03-17 06:08:20,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 25 select indices, 25 select index equivalence classes, 28 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 297 case distinctions, treesize of input 1096 treesize of output 2064