./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.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-75.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 3ea1453e8ddb919b166a2b196c485b49328495abf45a9dcbd47a0aceac1e3901 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:12:51,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:12:51,070 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:12:51,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:12:51,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:12:51,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:12:51,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:12:51,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:12:51,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:12:51,096 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:12:51,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:12:51,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:12:51,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:12:51,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:12:51,097 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:12:51,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:12:51,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:12:51,097 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:12:51,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:12:51,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:12:51,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:12:51,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:12:51,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:12:51,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:12:51,097 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:12:51,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:12:51,097 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:12:51,097 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:12:51,097 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:12:51,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:12:51,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:12:51,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:12:51,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:12:51,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:12:51,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:12:51,098 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:12:51,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:12:51,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:12:51,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:12:51,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:12:51,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:12:51,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:12:51,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:12:51,098 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 -> 3ea1453e8ddb919b166a2b196c485b49328495abf45a9dcbd47a0aceac1e3901 [2025-03-17 06:12:51,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:12:51,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:12:51,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:12:51,339 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:12:51,339 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:12:51,341 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-75.i [2025-03-17 06:12:52,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5e40ffb/60c0462a49ce4852913726ad3ad340f3/FLAG23eee4bd0 [2025-03-17 06:12:52,759 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:12:52,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i [2025-03-17 06:12:52,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5e40ffb/60c0462a49ce4852913726ad3ad340f3/FLAG23eee4bd0 [2025-03-17 06:12:53,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c5e40ffb/60c0462a49ce4852913726ad3ad340f3 [2025-03-17 06:12:53,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:12:53,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:12:53,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:12:53,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:12:53,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:12:53,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:53" (1/1) ... [2025-03-17 06:12:53,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc4196b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:53, skipping insertion in model container [2025-03-17 06:12:53,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:53" (1/1) ... [2025-03-17 06:12:53,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:12:53,238 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-75.i[917,930] [2025-03-17 06:12:53,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:12:53,297 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:12:53,307 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i[917,930] [2025-03-17 06:12:53,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:12:53,362 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:12:53,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:53 WrapperNode [2025-03-17 06:12:53,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:12:53,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:12:53,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:12:53,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:12:53,369 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:12:53" (1/1) ... [2025-03-17 06:12:53,383 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:12:53" (1/1) ... [2025-03-17 06:12:53,425 INFO L138 Inliner]: procedures = 30, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 472 [2025-03-17 06:12:53,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:12:53,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:12:53,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:12:53,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:12:53,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:53" (1/1) ... [2025-03-17 06:12:53,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:53" (1/1) ... [2025-03-17 06:12:53,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:53" (1/1) ... [2025-03-17 06:12:53,460 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:12:53,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:53" (1/1) ... [2025-03-17 06:12:53,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:53" (1/1) ... [2025-03-17 06:12:53,473 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:53" (1/1) ... [2025-03-17 06:12:53,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:53" (1/1) ... [2025-03-17 06:12:53,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:53" (1/1) ... [2025-03-17 06:12:53,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:53" (1/1) ... [2025-03-17 06:12:53,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:12:53,491 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:12:53,491 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:12:53,491 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:12:53,492 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:53" (1/1) ... [2025-03-17 06:12:53,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:12:53,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:53,516 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:12:53,518 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:12:53,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:12:53,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:12:53,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:12:53,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:12:53,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:12:53,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:12:53,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:12:53,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:12:53,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:12:53,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:12:53,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:12:53,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:12:53,638 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:12:53,640 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:12:54,033 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short105#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~ite123#1;havoc property_#t~mem111#1;havoc property_#t~ite120#1;havoc property_#t~mem119#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1; [2025-03-17 06:12:54,074 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2025-03-17 06:12:54,074 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:12:54,083 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:12:54,085 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:12:54,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:12:54 BoogieIcfgContainer [2025-03-17 06:12:54,086 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:12:54,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:12:54,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:12:54,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:12:54,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:12:53" (1/3) ... [2025-03-17 06:12:54,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362761f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:12:54, skipping insertion in model container [2025-03-17 06:12:54,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:53" (2/3) ... [2025-03-17 06:12:54,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362761f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:12:54, skipping insertion in model container [2025-03-17 06:12:54,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:12:54" (3/3) ... [2025-03-17 06:12:54,093 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-75.i [2025-03-17 06:12:54,102 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:12:54,104 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-75.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:12:54,140 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:12:54,148 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;@38560c50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:12:54,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:12:54,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 72 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 06:12:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:12:54,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:54,160 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:54,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:54,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash -210497153, now seen corresponding path program 1 times [2025-03-17 06:12:54,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:54,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929337097] [2025-03-17 06:12:54,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:54,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:54,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:12:54,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:12:54,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:54,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 06:12:54,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:54,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929337097] [2025-03-17 06:12:54,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929337097] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:12:54,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492104001] [2025-03-17 06:12:54,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:54,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:54,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:54,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:12:54,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:12:54,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:12:54,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:12:54,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:54,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:54,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:12:54,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 06:12:54,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:54,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492104001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:54,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:12:54,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:12:54,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435604183] [2025-03-17 06:12:54,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:54,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:12:54,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:54,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:12:54,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:12:54,730 INFO L87 Difference]: Start difference. First operand has 91 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 72 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 06:12:54,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:54,757 INFO L93 Difference]: Finished difference Result 179 states and 285 transitions. [2025-03-17 06:12:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:12:54,759 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2025-03-17 06:12:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:54,765 INFO L225 Difference]: With dead ends: 179 [2025-03-17 06:12:54,765 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 06:12:54,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:12:54,770 INFO L435 NwaCegarLoop]: 131 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, 131 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:12:54,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 06:12:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 06:12:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 06:12:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 131 transitions. [2025-03-17 06:12:54,797 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 131 transitions. Word has length 132 [2025-03-17 06:12:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:54,797 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 131 transitions. [2025-03-17 06:12:54,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 06:12:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 131 transitions. [2025-03-17 06:12:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:12:54,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:54,801 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:54,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:12:55,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:12:55,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:55,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:55,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1524948390, now seen corresponding path program 1 times [2025-03-17 06:12:55,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:55,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261546254] [2025-03-17 06:12:55,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:55,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:55,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:12:55,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:12:55,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:55,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 06:12:55,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:55,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261546254] [2025-03-17 06:12:55,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261546254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:55,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:55,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:12:55,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183618867] [2025-03-17 06:12:55,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:55,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:12:55,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:55,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:12:55,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:12:55,284 INFO L87 Difference]: Start difference. First operand 89 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 06:12:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:55,321 INFO L93 Difference]: Finished difference Result 180 states and 265 transitions. [2025-03-17 06:12:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:12:55,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-17 06:12:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:55,325 INFO L225 Difference]: With dead ends: 180 [2025-03-17 06:12:55,325 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 06:12:55,326 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:12:55,326 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:55,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 373 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 06:12:55,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-03-17 06:12:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 06:12:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2025-03-17 06:12:55,341 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 132 [2025-03-17 06:12:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:55,342 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2025-03-17 06:12:55,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 06:12:55,342 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2025-03-17 06:12:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:12:55,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:55,345 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:55,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:12:55,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:55,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1882515225, now seen corresponding path program 1 times [2025-03-17 06:12:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:55,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758716783] [2025-03-17 06:12:55,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:55,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:55,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:12:55,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:12:55,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:55,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 06:12:55,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:55,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758716783] [2025-03-17 06:12:55,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758716783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:55,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:55,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:12:55,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076390021] [2025-03-17 06:12:55,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:55,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:12:55,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:55,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:12:55,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:12:55,544 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 06:12:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:55,570 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2025-03-17 06:12:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:12:55,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-17 06:12:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:55,575 INFO L225 Difference]: With dead ends: 184 [2025-03-17 06:12:55,575 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 06:12:55,575 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:12:55,576 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:55,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 376 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 06:12:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-03-17 06:12:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 06:12:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-03-17 06:12:55,587 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 132 [2025-03-17 06:12:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:55,588 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-03-17 06:12:55,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 06:12:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-03-17 06:12:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:12:55,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:55,593 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:55,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:12:55,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:55,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:55,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1881591704, now seen corresponding path program 1 times [2025-03-17 06:12:55,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:55,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200739412] [2025-03-17 06:12:55,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:55,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:55,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:12:55,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:12:55,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:55,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 06:13:02,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:13:02,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200739412] [2025-03-17 06:13:02,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200739412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:02,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:02,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:13:02,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014508805] [2025-03-17 06:13:02,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:02,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:13:02,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:13:02,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:13:02,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:13:02,018 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 14 states, 11 states have (on average 4.545454545454546) internal successors, (50), 14 states have internal predecessors, (50), 6 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 6 states have call successors, (17) [2025-03-17 06:13:02,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:02,973 INFO L93 Difference]: Finished difference Result 185 states and 269 transitions. [2025-03-17 06:13:02,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:13:02,976 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.545454545454546) internal successors, (50), 14 states have internal predecessors, (50), 6 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 6 states have call successors, (17) Word has length 132 [2025-03-17 06:13:02,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:02,978 INFO L225 Difference]: With dead ends: 185 [2025-03-17 06:13:02,978 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 06:13:02,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:13:02,983 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 250 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:02,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 307 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:13:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 06:13:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-17 06:13:03,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 74 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 06:13:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 134 transitions. [2025-03-17 06:13:03,011 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 134 transitions. Word has length 132 [2025-03-17 06:13:03,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:03,011 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 134 transitions. [2025-03-17 06:13:03,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.545454545454546) internal successors, (50), 14 states have internal predecessors, (50), 6 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 6 states have call successors, (17) [2025-03-17 06:13:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 134 transitions. [2025-03-17 06:13:03,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 06:13:03,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:03,016 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:03,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:13:03,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:03,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:03,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1669846202, now seen corresponding path program 1 times [2025-03-17 06:13:03,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:13:03,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488014621] [2025-03-17 06:13:03,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:03,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:13:03,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 06:13:03,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 06:13:03,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:03,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 06:13:05,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:13:05,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488014621] [2025-03-17 06:13:05,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488014621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:05,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:05,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 06:13:05,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045766487] [2025-03-17 06:13:05,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:05,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 06:13:05,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:13:05,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 06:13:05,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:13:05,505 INFO L87 Difference]: Start difference. First operand 93 states and 134 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 06:13:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:06,342 INFO L93 Difference]: Finished difference Result 230 states and 330 transitions. [2025-03-17 06:13:06,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:13:06,343 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 134 [2025-03-17 06:13:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:06,344 INFO L225 Difference]: With dead ends: 230 [2025-03-17 06:13:06,344 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 06:13:06,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:13:06,345 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 414 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:06,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 425 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 06:13:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 06:13:06,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 111. [2025-03-17 06:13:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 states have internal predecessors, (127), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 06:13:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2025-03-17 06:13:06,365 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 134 [2025-03-17 06:13:06,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:06,365 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2025-03-17 06:13:06,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-17 06:13:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2025-03-17 06:13:06,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 06:13:06,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:06,366 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:06,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:13:06,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:06,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:06,367 INFO L85 PathProgramCache]: Analyzing trace with hash 948645543, now seen corresponding path program 1 times [2025-03-17 06:13:06,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:13:06,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409004269] [2025-03-17 06:13:06,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:06,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:13:06,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 06:13:06,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 06:13:06,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:06,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:06,918 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 06:13:06,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:13:06,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409004269] [2025-03-17 06:13:06,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409004269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:06,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:06,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:13:06,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899197086] [2025-03-17 06:13:06,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:06,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:13:06,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:13:06,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:13:06,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:13:06,920 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:13:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:07,556 INFO L93 Difference]: Finished difference Result 269 states and 391 transitions. [2025-03-17 06:13:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:13:07,557 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2025-03-17 06:13:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:07,559 INFO L225 Difference]: With dead ends: 269 [2025-03-17 06:13:07,559 INFO L226 Difference]: Without dead ends: 159 [2025-03-17 06:13:07,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-03-17 06:13:07,563 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 139 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:07,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 325 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:13:07,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-17 06:13:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-03-17 06:13:07,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 122 states have (on average 1.3360655737704918) internal successors, (163), 123 states have internal predecessors, (163), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 06:13:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 227 transitions. [2025-03-17 06:13:07,614 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 227 transitions. Word has length 135 [2025-03-17 06:13:07,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:07,615 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 227 transitions. [2025-03-17 06:13:07,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-17 06:13:07,616 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 227 transitions. [2025-03-17 06:13:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 06:13:07,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:07,617 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:07,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:13:07,617 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:07,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:07,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1089410746, now seen corresponding path program 1 times [2025-03-17 06:13:07,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:13:07,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793759456] [2025-03-17 06:13:07,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:13:07,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 06:13:07,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 06:13:07,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:07,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 06:13:08,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:13:08,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793759456] [2025-03-17 06:13:08,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793759456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:08,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:08,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:13:08,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074832445] [2025-03-17 06:13:08,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:08,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:13:08,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:13:08,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:13:08,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:13:08,209 INFO L87 Difference]: Start difference. First operand 157 states and 227 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 06:13:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:08,646 INFO L93 Difference]: Finished difference Result 316 states and 451 transitions. [2025-03-17 06:13:08,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:13:08,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-17 06:13:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:08,649 INFO L225 Difference]: With dead ends: 316 [2025-03-17 06:13:08,649 INFO L226 Difference]: Without dead ends: 200 [2025-03-17 06:13:08,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:13:08,652 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 128 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:08,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 390 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:13:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-17 06:13:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 164. [2025-03-17 06:13:08,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 129 states have (on average 1.3410852713178294) internal successors, (173), 130 states have internal predecessors, (173), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 06:13:08,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2025-03-17 06:13:08,685 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 135 [2025-03-17 06:13:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:08,685 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2025-03-17 06:13:08,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 06:13:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2025-03-17 06:13:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 06:13:08,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:08,686 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:08,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:13:08,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:08,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1599944923, now seen corresponding path program 1 times [2025-03-17 06:13:08,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:13:08,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678991093] [2025-03-17 06:13:08,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:08,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:13:08,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 06:13:08,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 06:13:08,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:08,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:13:08,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [724499872] [2025-03-17 06:13:08,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:08,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:13:08,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:13:08,784 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:13:08,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:13:08,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 06:13:10,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 06:13:10,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:10,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:13:10,191 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:13:10,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 06:13:10,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 06:13:10,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:10,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:13:10,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:13:10,794 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:13:10,795 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:13:10,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:13:10,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-17 06:13:10,999 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:13:11,097 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:13:11,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:13:11 BoogieIcfgContainer [2025-03-17 06:13:11,099 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:13:11,100 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:13:11,100 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:13:11,100 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:13:11,100 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:12:54" (3/4) ... [2025-03-17 06:13:11,102 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:13:11,103 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:13:11,103 INFO L158 Benchmark]: Toolchain (without parser) took 17993.84ms. Allocated memory was 201.3MB in the beginning and 604.0MB in the end (delta: 402.7MB). Free memory was 155.8MB in the beginning and 266.7MB in the end (delta: -110.9MB). Peak memory consumption was 294.0MB. Max. memory is 16.1GB. [2025-03-17 06:13:11,103 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:13:11,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.31ms. Allocated memory is still 201.3MB. Free memory was 155.5MB in the beginning and 139.9MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:13:11,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.59ms. Allocated memory is still 201.3MB. Free memory was 139.9MB in the beginning and 136.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:13:11,104 INFO L158 Benchmark]: Boogie Preprocessor took 59.45ms. Allocated memory is still 201.3MB. Free memory was 136.5MB in the beginning and 133.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:13:11,104 INFO L158 Benchmark]: IcfgBuilder took 594.76ms. Allocated memory is still 201.3MB. Free memory was 133.9MB in the beginning and 100.8MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:13:11,104 INFO L158 Benchmark]: TraceAbstraction took 17011.97ms. Allocated memory was 201.3MB in the beginning and 604.0MB in the end (delta: 402.7MB). Free memory was 100.1MB in the beginning and 266.8MB in the end (delta: -166.7MB). Peak memory consumption was 243.7MB. Max. memory is 16.1GB. [2025-03-17 06:13:11,104 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 604.0MB. Free memory was 266.8MB in the beginning and 266.7MB in the end (delta: 126.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:13:11,105 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.25ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.31ms. Allocated memory is still 201.3MB. Free memory was 155.5MB in the beginning and 139.9MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.59ms. Allocated memory is still 201.3MB. Free memory was 139.9MB in the beginning and 136.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.45ms. Allocated memory is still 201.3MB. Free memory was 136.5MB in the beginning and 133.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 594.76ms. Allocated memory is still 201.3MB. Free memory was 133.9MB in the beginning and 100.8MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17011.97ms. Allocated memory was 201.3MB in the beginning and 604.0MB in the end (delta: 402.7MB). Free memory was 100.1MB in the beginning and 266.8MB in the end (delta: -166.7MB). Peak memory consumption was 243.7MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 604.0MB. Free memory was 266.8MB in the beginning and 266.7MB in the end (delta: 126.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 121, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 130. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L55] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L57] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L58] double* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L59] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L60] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L61] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L62] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L63] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L64] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L65] float* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L66] float* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L67] signed char* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); [L68] signed char* WrapperStruct00_var_1_21_Pointer = &(WrapperStruct00.var_1_21); [L69] signed long int last_1_WrapperStruct00_var_1_8 = -100; [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L127] EXPR WrapperStruct00.var_1_8 [L127] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L137] RET updateLastVariables() [L138] CALL updateVariables() [L99] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L101] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L102] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L103] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L105] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L108] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L111] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L113] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L114] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L117] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L119] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L120] WrapperStruct00.var_1_19 = __VERIFIER_nondet_float() [L121] EXPR WrapperStruct00.var_1_19 [L121] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F [L121] EXPR WrapperStruct00.var_1_19 [L121] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L121] EXPR (WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L121] CALL assume_abort_if_not((WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L121] RET assume_abort_if_not((WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L122] WrapperStruct00.var_1_21 = __VERIFIER_nondet_char() [L123] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_21 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L124] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L138] RET updateVariables() [L139] CALL step() [L73] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L73] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L74] EXPR \read(*WrapperStruct00_var_1_21_Pointer) [L74] (*(WrapperStruct00_var_1_20_Pointer)) = (*(WrapperStruct00_var_1_21_Pointer)) [L75] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L75] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L75] EXPR \read(*WrapperStruct00_var_1_18_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L75] COND FALSE !(((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) [L78] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L78] COND TRUE (*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer)) [L79] (*(WrapperStruct00_var_1_8_Pointer)) = 256 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L84] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L84] signed long int stepLocal_0 = ((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer)); [L85] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100, stepLocal_0=-65536] [L85] EXPR (((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L85] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L85] EXPR (((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100, stepLocal_0=-65536] [L85] COND TRUE stepLocal_0 < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L90] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L90] ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer)) [L90] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L90] ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L90] COND FALSE !(((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) [L95] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L95] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR (((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) [L130] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L130] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer)))))) [L130] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_18_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L130] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((float) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR ((((((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((float) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_21_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130-L131] return ((((((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((float) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_21_Pointer)))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 152 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 8, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 937 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 933 mSDsluCounter, 2327 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1590 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2095 IncrementalHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 737 mSDtfsCounter, 2095 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 168 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=7, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 67 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 1334 NumberOfCodeBlocks, 1334 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1056 ConstructedInterpolants, 0 QuantifiedInterpolants, 10988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 570 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 4320/4352 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:13:11,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.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 3ea1453e8ddb919b166a2b196c485b49328495abf45a9dcbd47a0aceac1e3901 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:13:13,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:13:13,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:13:13,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:13:13,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:13:13,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:13:13,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:13:13,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:13:13,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:13:13,258 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:13:13,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:13:13,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:13:13,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:13:13,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:13:13,259 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:13:13,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:13:13,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:13:13,259 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:13:13,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:13:13,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:13:13,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:13:13,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:13:13,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:13:13,260 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:13:13,260 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:13:13,260 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:13:13,260 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:13:13,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:13:13,260 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:13:13,260 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:13:13,260 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:13:13,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:13:13,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:13:13,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:13:13,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:13:13,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:13:13,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:13:13,261 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:13:13,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:13:13,261 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:13:13,261 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:13:13,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:13:13,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:13:13,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:13:13,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:13:13,261 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 -> 3ea1453e8ddb919b166a2b196c485b49328495abf45a9dcbd47a0aceac1e3901 [2025-03-17 06:13:13,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:13:13,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:13:13,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:13:13,500 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:13:13,500 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:13:13,501 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-75.i [2025-03-17 06:13:14,638 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011df2947/fdab785fa0d54aa09b51eb6f99aef2ba/FLAGcec81b20b [2025-03-17 06:13:14,837 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:13:14,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i [2025-03-17 06:13:14,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011df2947/fdab785fa0d54aa09b51eb6f99aef2ba/FLAGcec81b20b [2025-03-17 06:13:14,861 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/011df2947/fdab785fa0d54aa09b51eb6f99aef2ba [2025-03-17 06:13:14,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:13:14,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:13:14,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:13:14,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:13:14,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:13:14,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:13:14" (1/1) ... [2025-03-17 06:13:14,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88f11eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:13:14, skipping insertion in model container [2025-03-17 06:13:14,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:13:14" (1/1) ... [2025-03-17 06:13:14,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:13:14,993 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-75.i[917,930] [2025-03-17 06:13:15,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:13:15,071 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:13:15,080 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-75.i[917,930] [2025-03-17 06:13:15,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:13:15,144 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:13:15,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:13:15 WrapperNode [2025-03-17 06:13:15,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:13:15,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:13:15,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:13:15,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:13:15,152 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:13:15" (1/1) ... [2025-03-17 06:13:15,169 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:13:15" (1/1) ... [2025-03-17 06:13:15,204 INFO L138 Inliner]: procedures = 37, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 470 [2025-03-17 06:13:15,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:13:15,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:13:15,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:13:15,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:13:15,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:13:15" (1/1) ... [2025-03-17 06:13:15,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:13:15" (1/1) ... [2025-03-17 06:13:15,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:13:15" (1/1) ... [2025-03-17 06:13:15,253 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 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:13:15,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:13:15" (1/1) ... [2025-03-17 06:13:15,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:13:15" (1/1) ... [2025-03-17 06:13:15,272 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:13:15" (1/1) ... [2025-03-17 06:13:15,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:13:15" (1/1) ... [2025-03-17 06:13:15,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:13:15" (1/1) ... [2025-03-17 06:13:15,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:13:15" (1/1) ... [2025-03-17 06:13:15,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:13:15,290 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:13:15,290 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:13:15,290 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:13:15,291 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:13:15" (1/1) ... [2025-03-17 06:13:15,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:13:15,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:13:15,313 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:13:15,314 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:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:13:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:13:15,331 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:13:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:13:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:13:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:13:15,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:13:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:13:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:13:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 06:13:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 06:13:15,458 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:13:15,459 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:13:35,698 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short105#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~ite123#1;havoc property_#t~mem111#1;havoc property_#t~ite120#1;havoc property_#t~mem119#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1; [2025-03-17 06:13:35,744 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2025-03-17 06:13:35,744 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:13:35,750 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:13:35,751 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:13:35,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:13:35 BoogieIcfgContainer [2025-03-17 06:13:35,751 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:13:35,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:13:35,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:13:35,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:13:35,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:13:14" (1/3) ... [2025-03-17 06:13:35,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197e630f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:13:35, skipping insertion in model container [2025-03-17 06:13:35,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:13:15" (2/3) ... [2025-03-17 06:13:35,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197e630f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:13:35, skipping insertion in model container [2025-03-17 06:13:35,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:13:35" (3/3) ... [2025-03-17 06:13:35,757 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-75.i [2025-03-17 06:13:35,766 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:13:35,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-75.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:13:35,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:13:35,813 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;@d1d55cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:13:35,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:13:35,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 72 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 06:13:35,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:13:35,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:35,828 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:35,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:35,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1605945105, now seen corresponding path program 1 times [2025-03-17 06:13:35,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:13:35,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399081773] [2025-03-17 06:13:35,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:35,842 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:13:35,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:13:35,845 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:13:35,846 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:13:35,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:13:37,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:13:37,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:37,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:37,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:13:37,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:37,290 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-03-17 06:13:37,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:13:37,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:13:37,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399081773] [2025-03-17 06:13:37,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399081773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:37,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:37,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:13:37,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305062472] [2025-03-17 06:13:37,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:37,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:13:37,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:13:37,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:13:37,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:13:37,313 INFO L87 Difference]: Start difference. First operand has 91 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 72 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 06:13:37,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:37,329 INFO L93 Difference]: Finished difference Result 179 states and 285 transitions. [2025-03-17 06:13:37,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:13:37,331 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2025-03-17 06:13:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:37,335 INFO L225 Difference]: With dead ends: 179 [2025-03-17 06:13:37,336 INFO L226 Difference]: Without dead ends: 89 [2025-03-17 06:13:37,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:13:37,340 INFO L435 NwaCegarLoop]: 131 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, 131 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:13:37,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:13:37,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-17 06:13:37,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-17 06:13:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 06:13:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 131 transitions. [2025-03-17 06:13:37,372 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 131 transitions. Word has length 132 [2025-03-17 06:13:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:37,372 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 131 transitions. [2025-03-17 06:13:37,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 06:13:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 131 transitions. [2025-03-17 06:13:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:13:37,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:37,376 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:37,409 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:13:37,577 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:13:37,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:37,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:37,578 INFO L85 PathProgramCache]: Analyzing trace with hash 129500438, now seen corresponding path program 1 times [2025-03-17 06:13:37,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:13:37,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773273114] [2025-03-17 06:13:37,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:37,578 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:13:37,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:13:37,582 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:13:37,584 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:13:37,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:13:38,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:13:38,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:38,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:39,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:13:39,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-17 06:13:39,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:13:39,442 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:13:39,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773273114] [2025-03-17 06:13:39,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773273114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:39,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:39,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:13:39,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345144331] [2025-03-17 06:13:39,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:39,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:13:39,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:13:39,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:13:39,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:13:39,445 INFO L87 Difference]: Start difference. First operand 89 states and 131 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 06:13:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:39,972 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2025-03-17 06:13:39,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:13:39,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2025-03-17 06:13:39,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:39,975 INFO L225 Difference]: With dead ends: 179 [2025-03-17 06:13:39,976 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 06:13:39,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:13:39,977 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:39,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:13:39,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 06:13:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-17 06:13:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 06:13:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2025-03-17 06:13:39,985 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 132 [2025-03-17 06:13:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:39,986 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2025-03-17 06:13:39,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 06:13:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2025-03-17 06:13:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:13:39,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:39,990 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:40,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 06:13:40,190 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:13:40,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:40,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1096745353, now seen corresponding path program 1 times [2025-03-17 06:13:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:13:40,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563112893] [2025-03-17 06:13:40,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:40,192 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:13:40,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:13:40,193 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:13:40,194 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:13:40,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:13:41,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:13:41,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:41,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:41,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:13:41,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-17 06:13:42,085 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:13:42,085 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:13:42,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563112893] [2025-03-17 06:13:42,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563112893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:42,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:42,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:13:42,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832225866] [2025-03-17 06:13:42,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:42,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:13:42,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:13:42,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:13:42,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:13:42,087 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 06:13:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:42,579 INFO L93 Difference]: Finished difference Result 183 states and 268 transitions. [2025-03-17 06:13:42,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:13:42,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2025-03-17 06:13:42,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:42,583 INFO L225 Difference]: With dead ends: 183 [2025-03-17 06:13:42,583 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 06:13:42,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:13:42,584 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:42,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:13:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 06:13:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-17 06:13:42,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 06:13:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-03-17 06:13:42,597 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 132 [2025-03-17 06:13:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:42,597 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-03-17 06:13:42,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 06:13:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-03-17 06:13:42,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:13:42,599 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:42,599 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:42,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 06:13:42,799 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:13:42,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:42,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:42,800 INFO L85 PathProgramCache]: Analyzing trace with hash -648048714, now seen corresponding path program 1 times [2025-03-17 06:13:42,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:13:42,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211415228] [2025-03-17 06:13:42,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:42,801 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:13:42,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:13:42,803 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:13:42,805 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:13:42,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:13:44,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:13:44,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:44,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:44,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:13:44,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 06:13:45,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:13:45,079 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:13:45,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211415228] [2025-03-17 06:13:45,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211415228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:45,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:45,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:13:45,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203280714] [2025-03-17 06:13:45,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:45,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:13:45,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:13:45,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:13:45,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:13:45,080 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 06:13:46,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:46,012 INFO L93 Difference]: Finished difference Result 190 states and 276 transitions. [2025-03-17 06:13:46,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:13:46,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-17 06:13:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:46,014 INFO L225 Difference]: With dead ends: 190 [2025-03-17 06:13:46,014 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 06:13:46,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:13:46,015 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:46,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 488 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 06:13:46,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 06:13:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-17 06:13:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 06:13:46,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-03-17 06:13:46,035 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 132 [2025-03-17 06:13:46,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:46,036 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-03-17 06:13:46,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 06:13:46,036 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-03-17 06:13:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:13:46,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:46,037 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:46,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 06:13:46,237 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:13:46,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:46,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:46,238 INFO L85 PathProgramCache]: Analyzing trace with hash 239454967, now seen corresponding path program 1 times [2025-03-17 06:13:46,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:13:46,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145668927] [2025-03-17 06:13:46,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:46,239 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:13:46,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:13:46,242 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:13:46,244 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:13:46,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:13:47,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:13:47,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:47,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:47,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:13:47,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 06:13:48,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:13:48,616 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:13:48,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145668927] [2025-03-17 06:13:48,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145668927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:13:48,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:13:48,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:13:48,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020249944] [2025-03-17 06:13:48,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:13:48,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:13:48,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:13:48,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:13:48,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:13:48,617 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 06:13:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:13:49,900 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2025-03-17 06:13:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:13:49,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-17 06:13:49,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:13:49,902 INFO L225 Difference]: With dead ends: 196 [2025-03-17 06:13:49,902 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 06:13:49,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:13:49,903 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:13:49,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 604 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 06:13:49,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 06:13:49,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-03-17 06:13:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 06:13:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2025-03-17 06:13:49,909 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 132 [2025-03-17 06:13:49,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:13:49,910 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2025-03-17 06:13:49,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 06:13:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2025-03-17 06:13:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 06:13:49,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:13:49,911 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:49,954 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:13:50,111 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:13:50,112 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:13:50,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:13:50,112 INFO L85 PathProgramCache]: Analyzing trace with hash 240378488, now seen corresponding path program 1 times [2025-03-17 06:13:50,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:13:50,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439898804] [2025-03-17 06:13:50,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:13:50,113 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:13:50,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:13:50,114 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:13:50,116 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:13:50,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 06:13:53,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 06:13:53,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:13:53,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:13:53,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 06:13:53,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:13:55,313 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:14:05,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-03-17 06:14:21,540 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 29 treesize of output 31