./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 9000cc374a0af085b03570a511ad19fd711a120ab7f5d5a9a2c4565265355a73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:03:02,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:03:03,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:03:03,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:03:03,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:03:03,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:03:03,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:03:03,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:03:03,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:03:03,051 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:03:03,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:03:03,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:03:03,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:03:03,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:03:03,053 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:03:03,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:03:03,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:03:03,053 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:03:03,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:03:03,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:03:03,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:03:03,053 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:03:03,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:03:03,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:03:03,054 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:03:03,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:03:03,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:03:03,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:03:03,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:03:03,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:03:03,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:03:03,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:03:03,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:03:03,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:03:03,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:03:03,055 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:03:03,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:03:03,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:03:03,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:03:03,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:03:03,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:03:03,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:03:03,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:03:03,056 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-jdk21/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 -> 9000cc374a0af085b03570a511ad19fd711a120ab7f5d5a9a2c4565265355a73 [2025-02-06 04:03:03,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:03:03,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:03:03,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:03:03,308 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:03:03,308 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:03:03,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i [2025-02-06 04:03:04,506 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/120f614b0/7007bda5dd0b45adbbb8cc7b6ea3e108/FLAGbd7591fb4 [2025-02-06 04:03:04,802 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:03:04,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i [2025-02-06 04:03:04,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/120f614b0/7007bda5dd0b45adbbb8cc7b6ea3e108/FLAGbd7591fb4 [2025-02-06 04:03:05,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/120f614b0/7007bda5dd0b45adbbb8cc7b6ea3e108 [2025-02-06 04:03:05,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:03:05,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:03:05,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:03:05,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:03:05,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:03:05,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:03:05" (1/1) ... [2025-02-06 04:03:05,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e09fed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:05, skipping insertion in model container [2025-02-06 04:03:05,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:03:05" (1/1) ... [2025-02-06 04:03:05,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:03:05,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i[917,930] [2025-02-06 04:03:05,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:03:05,283 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:03:05,290 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i[917,930] [2025-02-06 04:03:05,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:03:05,323 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:03:05,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:05 WrapperNode [2025-02-06 04:03:05,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:03:05,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:03:05,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:03:05,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:03:05,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:05" (1/1) ... [2025-02-06 04:03:05,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:05" (1/1) ... [2025-02-06 04:03:05,365 INFO L138 Inliner]: procedures = 30, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 609 [2025-02-06 04:03:05,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:03:05,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:03:05,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:03:05,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:03:05,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:05" (1/1) ... [2025-02-06 04:03:05,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:05" (1/1) ... [2025-02-06 04:03:05,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:05" (1/1) ... [2025-02-06 04:03:05,390 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 04:03:05,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:05" (1/1) ... [2025-02-06 04:03:05,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:05" (1/1) ... [2025-02-06 04:03:05,410 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:05" (1/1) ... [2025-02-06 04:03:05,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:05" (1/1) ... [2025-02-06 04:03:05,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:05" (1/1) ... [2025-02-06 04:03:05,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:05" (1/1) ... [2025-02-06 04:03:05,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:03:05,424 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:03:05,424 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:03:05,424 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:03:05,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:05" (1/1) ... [2025-02-06 04:03:05,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:03:05,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:03:05,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:03:05,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:03:05,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 04:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 04:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 04:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 04:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 04:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 04:03:05,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:03:05,480 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 04:03:05,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:03:05,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:03:05,603 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:03:05,604 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:03:06,125 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem113#1;havoc property_#t~mem106#1;havoc property_#t~mem112#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite111#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite131#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~mem123#1;havoc property_#t~ite128#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short132#1;havoc property_#t~mem136#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~bitwise135#1;havoc property_#t~mem137#1;havoc property_#t~ite176#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem142#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~ite173#1;havoc property_#t~mem170#1;havoc property_#t~mem148#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~ite155#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem151#1;havoc property_#t~ite154#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~ite169#1;havoc property_#t~mem161#1;havoc property_#t~mem156#1;havoc property_#t~mem157#1;havoc property_#t~ite160#1;havoc property_#t~mem158#1;havoc property_#t~mem159#1;havoc property_#t~ite168#1;havoc property_#t~mem162#1;havoc property_#t~mem163#1;havoc property_#t~mem164#1;havoc property_#t~ite167#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~mem172#1;havoc property_#t~mem171#1;havoc property_#t~mem175#1;havoc property_#t~mem174#1;havoc property_#t~short177#1; [2025-02-06 04:03:06,178 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2025-02-06 04:03:06,178 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:03:06,191 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:03:06,192 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:03:06,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:03:06 BoogieIcfgContainer [2025-02-06 04:03:06,192 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:03:06,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:03:06,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:03:06,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:03:06,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:03:05" (1/3) ... [2025-02-06 04:03:06,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7aa0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:03:06, skipping insertion in model container [2025-02-06 04:03:06,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:05" (2/3) ... [2025-02-06 04:03:06,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7aa0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:03:06, skipping insertion in model container [2025-02-06 04:03:06,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:03:06" (3/3) ... [2025-02-06 04:03:06,206 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-39.i [2025-02-06 04:03:06,224 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:03:06,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-39.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:03:06,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:03:06,292 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;@27161ea1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:03:06,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:03:06,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 100 states have (on average 1.43) internal successors, (143), 101 states have internal predecessors, (143), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:03:06,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 04:03:06,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:06,303 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:03:06,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:06,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:06,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1027712971, now seen corresponding path program 1 times [2025-02-06 04:03:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:06,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971290037] [2025-02-06 04:03:06,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:06,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:06,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 04:03:06,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 04:03:06,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:06,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 04:03:06,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:06,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971290037] [2025-02-06 04:03:06,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971290037] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:03:06,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863791381] [2025-02-06 04:03:06,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:06,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:03:06,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:03:06,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:03:06,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:03:06,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 04:03:06,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 04:03:06,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:06,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:06,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:03:06,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:03:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-02-06 04:03:06,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:03:06,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863791381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:06,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:03:06,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:03:06,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560800835] [2025-02-06 04:03:06,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:06,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:03:06,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:06,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:03:06,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:03:06,828 INFO L87 Difference]: Start difference. First operand has 119 states, 100 states have (on average 1.43) internal successors, (143), 101 states have internal predecessors, (143), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:03:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:06,848 INFO L93 Difference]: Finished difference Result 232 states and 361 transitions. [2025-02-06 04:03:06,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:03:06,850 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2025-02-06 04:03:06,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:06,854 INFO L225 Difference]: With dead ends: 232 [2025-02-06 04:03:06,854 INFO L226 Difference]: Without dead ends: 116 [2025-02-06 04:03:06,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:03:06,858 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:06,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:03:06,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-06 04:03:06,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-02-06 04:03:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 98 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:03:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2025-02-06 04:03:06,884 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 128 [2025-02-06 04:03:06,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:06,885 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2025-02-06 04:03:06,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:03:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2025-02-06 04:03:06,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 04:03:06,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:06,888 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:03:06,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 04:03:07,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 04:03:07,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:07,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:07,090 INFO L85 PathProgramCache]: Analyzing trace with hash -898972329, now seen corresponding path program 1 times [2025-02-06 04:03:07,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:07,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395306142] [2025-02-06 04:03:07,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:07,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:07,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 04:03:07,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 04:03:07,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:07,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:03:07,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:07,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395306142] [2025-02-06 04:03:07,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395306142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:07,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:07,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:03:07,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381753988] [2025-02-06 04:03:07,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:07,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:03:07,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:07,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:03:07,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:03:07,428 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:03:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:07,466 INFO L93 Difference]: Finished difference Result 231 states and 340 transitions. [2025-02-06 04:03:07,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:03:07,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2025-02-06 04:03:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:07,468 INFO L225 Difference]: With dead ends: 231 [2025-02-06 04:03:07,468 INFO L226 Difference]: Without dead ends: 118 [2025-02-06 04:03:07,468 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-02-06 04:03:07,469 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:07,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:03:07,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-06 04:03:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-06 04:03:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:03:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 172 transitions. [2025-02-06 04:03:07,479 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 172 transitions. Word has length 128 [2025-02-06 04:03:07,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:07,481 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 172 transitions. [2025-02-06 04:03:07,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:03:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 172 transitions. [2025-02-06 04:03:07,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 04:03:07,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:07,482 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:03:07,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:03:07,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:07,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1614495032, now seen corresponding path program 1 times [2025-02-06 04:03:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:07,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077105116] [2025-02-06 04:03:07,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:07,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 04:03:07,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 04:03:07,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:07,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:03:16,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:16,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077105116] [2025-02-06 04:03:16,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077105116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:16,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:16,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 04:03:16,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811795549] [2025-02-06 04:03:16,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:16,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 04:03:16,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:16,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 04:03:16,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:03:16,006 INFO L87 Difference]: Start difference. First operand 118 states and 172 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 04:03:19,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:19,520 INFO L93 Difference]: Finished difference Result 294 states and 431 transitions. [2025-02-06 04:03:19,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 04:03:19,523 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 128 [2025-02-06 04:03:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:19,525 INFO L225 Difference]: With dead ends: 294 [2025-02-06 04:03:19,525 INFO L226 Difference]: Without dead ends: 179 [2025-02-06 04:03:19,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2025-02-06 04:03:19,527 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 729 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:19,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 791 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 04:03:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-06 04:03:19,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 128. [2025-02-06 04:03:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 110 states have (on average 1.4) internal successors, (154), 110 states have internal predecessors, (154), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:03:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 186 transitions. [2025-02-06 04:03:19,539 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 186 transitions. Word has length 128 [2025-02-06 04:03:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:19,539 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 186 transitions. [2025-02-06 04:03:19,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 17 states have internal predecessors, (51), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 04:03:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 186 transitions. [2025-02-06 04:03:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 04:03:19,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:19,545 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:03:19,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:03:19,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:19,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:19,545 INFO L85 PathProgramCache]: Analyzing trace with hash -192959431, now seen corresponding path program 1 times [2025-02-06 04:03:19,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:19,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796580651] [2025-02-06 04:03:19,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:19,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:19,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 04:03:19,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 04:03:19,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:19,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:03:23,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:23,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796580651] [2025-02-06 04:03:23,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796580651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:23,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:23,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 04:03:23,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930922670] [2025-02-06 04:03:23,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:23,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 04:03:23,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:23,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 04:03:23,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-02-06 04:03:23,096 INFO L87 Difference]: Start difference. First operand 128 states and 186 transitions. Second operand has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 04:03:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:25,289 INFO L93 Difference]: Finished difference Result 376 states and 548 transitions. [2025-02-06 04:03:25,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:03:25,290 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 128 [2025-02-06 04:03:25,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:25,291 INFO L225 Difference]: With dead ends: 376 [2025-02-06 04:03:25,292 INFO L226 Difference]: Without dead ends: 251 [2025-02-06 04:03:25,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2025-02-06 04:03:25,293 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 516 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:25,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 736 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 04:03:25,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-06 04:03:25,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 195. [2025-02-06 04:03:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 172 states have (on average 1.4127906976744187) internal successors, (243), 173 states have internal predecessors, (243), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 04:03:25,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 283 transitions. [2025-02-06 04:03:25,316 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 283 transitions. Word has length 128 [2025-02-06 04:03:25,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:25,317 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 283 transitions. [2025-02-06 04:03:25,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.642857142857143) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 04:03:25,317 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 283 transitions. [2025-02-06 04:03:25,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 04:03:25,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:25,318 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:03:25,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:03:25,319 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:25,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:25,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1327162567, now seen corresponding path program 1 times [2025-02-06 04:03:25,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:25,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211964845] [2025-02-06 04:03:25,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:25,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:25,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 04:03:25,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 04:03:25,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:25,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:03:26,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:26,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211964845] [2025-02-06 04:03:26,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211964845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:26,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:26,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:03:26,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201300185] [2025-02-06 04:03:26,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:26,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:03:26,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:26,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:03:26,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:03:26,810 INFO L87 Difference]: Start difference. First operand 195 states and 283 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:03:27,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:27,811 INFO L93 Difference]: Finished difference Result 449 states and 649 transitions. [2025-02-06 04:03:27,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:03:27,814 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2025-02-06 04:03:27,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:27,816 INFO L225 Difference]: With dead ends: 449 [2025-02-06 04:03:27,816 INFO L226 Difference]: Without dead ends: 257 [2025-02-06 04:03:27,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-02-06 04:03:27,818 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 460 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:27,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 561 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 04:03:27,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-02-06 04:03:27,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 154. [2025-02-06 04:03:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.4) internal successors, (189), 135 states have internal predecessors, (189), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:03:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 221 transitions. [2025-02-06 04:03:27,838 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 221 transitions. Word has length 128 [2025-02-06 04:03:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:27,838 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 221 transitions. [2025-02-06 04:03:27,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:03:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 221 transitions. [2025-02-06 04:03:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 04:03:27,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:27,840 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:03:27,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:03:27,840 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:27,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1160350266, now seen corresponding path program 1 times [2025-02-06 04:03:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:27,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205618593] [2025-02-06 04:03:27,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:27,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 04:03:27,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 04:03:27,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:27,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-02-06 04:03:32,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:32,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205618593] [2025-02-06 04:03:32,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205618593] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:03:32,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928632194] [2025-02-06 04:03:32,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:32,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:03:32,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:03:32,585 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:03:32,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:03:32,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 04:03:32,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 04:03:32,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:32,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:32,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-02-06 04:03:32,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:03:33,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:03:33,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 04:03:34,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 04:03:34,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 04:03:35,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 04:03:35,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 04:03:35,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 04:03:36,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 04:03:36,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 04:03:37,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 90 [2025-02-06 04:03:37,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,314 INFO L349 Elim1Store]: treesize reduction 73, result has 8.8 percent of original size [2025-02-06 04:03:37,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 149 treesize of output 108 [2025-02-06 04:03:37,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,696 INFO L349 Elim1Store]: treesize reduction 88, result has 23.5 percent of original size [2025-02-06 04:03:37,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 101 treesize of output 99 [2025-02-06 04:03:37,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:03:37,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 60 [2025-02-06 04:03:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 13 proven. 151 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-02-06 04:03:38,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:03:39,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928632194] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:03:39,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:03:39,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2025-02-06 04:03:39,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577082727] [2025-02-06 04:03:39,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 04:03:39,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 04:03:39,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:39,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 04:03:39,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 04:03:39,104 INFO L87 Difference]: Start difference. First operand 154 states and 221 transitions. Second operand has 32 states, 31 states have (on average 3.3548387096774195) internal successors, (104), 32 states have internal predecessors, (104), 7 states have call successors, (32), 4 states have call predecessors, (32), 5 states have return successors, (32), 6 states have call predecessors, (32), 7 states have call successors, (32) [2025-02-06 04:03:46,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:46,733 INFO L93 Difference]: Finished difference Result 479 states and 682 transitions. [2025-02-06 04:03:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-06 04:03:46,734 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3548387096774195) internal successors, (104), 32 states have internal predecessors, (104), 7 states have call successors, (32), 4 states have call predecessors, (32), 5 states have return successors, (32), 6 states have call predecessors, (32), 7 states have call successors, (32) Word has length 128 [2025-02-06 04:03:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:46,737 INFO L225 Difference]: With dead ends: 479 [2025-02-06 04:03:46,737 INFO L226 Difference]: Without dead ends: 328 [2025-02-06 04:03:46,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=709, Invalid=4261, Unknown=0, NotChecked=0, Total=4970 [2025-02-06 04:03:46,740 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1038 mSDsluCounter, 2250 mSDsCounter, 0 mSdLazyCounter, 4188 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 2380 SdHoareTripleChecker+Invalid, 4301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 4188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:46,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 2380 Invalid, 4301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 4188 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-06 04:03:46,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-06 04:03:46,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 158. [2025-02-06 04:03:46,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 138 states have (on average 1.391304347826087) internal successors, (192), 138 states have internal predecessors, (192), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:03:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 224 transitions. [2025-02-06 04:03:46,777 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 224 transitions. Word has length 128 [2025-02-06 04:03:46,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:46,777 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 224 transitions. [2025-02-06 04:03:46,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3548387096774195) internal successors, (104), 32 states have internal predecessors, (104), 7 states have call successors, (32), 4 states have call predecessors, (32), 5 states have return successors, (32), 6 states have call predecessors, (32), 7 states have call successors, (32) [2025-02-06 04:03:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 224 transitions. [2025-02-06 04:03:46,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 04:03:46,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:46,779 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:03:46,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 04:03:46,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:03:46,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:46,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:46,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1868618600, now seen corresponding path program 1 times [2025-02-06 04:03:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:46,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943349894] [2025-02-06 04:03:46,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:46,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:47,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 04:03:47,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 04:03:47,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:47,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:03:51,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:51,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943349894] [2025-02-06 04:03:51,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943349894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:51,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:51,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 04:03:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502626075] [2025-02-06 04:03:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:51,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 04:03:51,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:51,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 04:03:51,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:03:51,165 INFO L87 Difference]: Start difference. First operand 158 states and 224 transitions. Second operand has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 04:03:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:53,066 INFO L93 Difference]: Finished difference Result 350 states and 496 transitions. [2025-02-06 04:03:53,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 04:03:53,066 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 129 [2025-02-06 04:03:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:53,067 INFO L225 Difference]: With dead ends: 350 [2025-02-06 04:03:53,067 INFO L226 Difference]: Without dead ends: 195 [2025-02-06 04:03:53,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2025-02-06 04:03:53,068 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 563 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:53,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 666 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 04:03:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-06 04:03:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 150. [2025-02-06 04:03:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 130 states have (on average 1.3923076923076922) internal successors, (181), 130 states have internal predecessors, (181), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:03:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 213 transitions. [2025-02-06 04:03:53,090 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 213 transitions. Word has length 129 [2025-02-06 04:03:53,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:53,090 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 213 transitions. [2025-02-06 04:03:53,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 17 states have internal predecessors, (52), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 04:03:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 213 transitions. [2025-02-06 04:03:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 04:03:53,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:53,092 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:03:53,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:03:53,092 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:53,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:53,092 INFO L85 PathProgramCache]: Analyzing trace with hash -212865137, now seen corresponding path program 1 times [2025-02-06 04:03:53,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:53,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832842184] [2025-02-06 04:03:53,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:53,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:53,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 04:03:53,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 04:03:53,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:53,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:03:53,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832842184] [2025-02-06 04:03:53,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832842184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:53,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:53,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:03:53,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952378910] [2025-02-06 04:03:53,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:53,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:03:53,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:53,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:03:53,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:03:53,431 INFO L87 Difference]: Start difference. First operand 150 states and 213 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:03:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:53,880 INFO L93 Difference]: Finished difference Result 374 states and 535 transitions. [2025-02-06 04:03:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:03:53,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 130 [2025-02-06 04:03:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:53,882 INFO L225 Difference]: With dead ends: 374 [2025-02-06 04:03:53,882 INFO L226 Difference]: Without dead ends: 227 [2025-02-06 04:03:53,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:03:53,882 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 448 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:53,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 483 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:03:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-06 04:03:53,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 194. [2025-02-06 04:03:53,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 174 states have (on average 1.4137931034482758) internal successors, (246), 174 states have internal predecessors, (246), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:03:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 278 transitions. [2025-02-06 04:03:53,902 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 278 transitions. Word has length 130 [2025-02-06 04:03:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:53,902 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 278 transitions. [2025-02-06 04:03:53,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:03:53,902 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 278 transitions. [2025-02-06 04:03:53,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 04:03:53,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:53,903 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:03:53,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:03:53,904 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:53,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash 129541919, now seen corresponding path program 1 times [2025-02-06 04:03:53,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:53,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415827496] [2025-02-06 04:03:53,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:53,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:53,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 04:03:53,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 04:03:53,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:53,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:03:54,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:54,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415827496] [2025-02-06 04:03:54,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415827496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:54,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:54,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:03:54,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321963297] [2025-02-06 04:03:54,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:54,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:03:54,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:54,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:03:54,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:03:54,429 INFO L87 Difference]: Start difference. First operand 194 states and 278 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:03:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:54,954 INFO L93 Difference]: Finished difference Result 418 states and 599 transitions. [2025-02-06 04:03:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:03:54,955 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-02-06 04:03:54,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:54,956 INFO L225 Difference]: With dead ends: 418 [2025-02-06 04:03:54,956 INFO L226 Difference]: Without dead ends: 227 [2025-02-06 04:03:54,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:03:54,957 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 271 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:54,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 608 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:03:54,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-06 04:03:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 194. [2025-02-06 04:03:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 174 states have (on average 1.4080459770114941) internal successors, (245), 174 states have internal predecessors, (245), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:03:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 277 transitions. [2025-02-06 04:03:54,978 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 277 transitions. Word has length 133 [2025-02-06 04:03:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:54,978 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 277 transitions. [2025-02-06 04:03:54,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:03:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 277 transitions. [2025-02-06 04:03:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 04:03:54,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:54,979 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:03:54,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 04:03:54,980 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:54,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash -324706413, now seen corresponding path program 1 times [2025-02-06 04:03:54,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:54,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124671965] [2025-02-06 04:03:54,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:54,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:55,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 04:03:55,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 04:03:55,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:55,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:03:55,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:55,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124671965] [2025-02-06 04:03:55,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124671965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:55,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:55,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:03:55,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091506106] [2025-02-06 04:03:55,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:55,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:03:55,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:55,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:03:55,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:03:55,458 INFO L87 Difference]: Start difference. First operand 194 states and 277 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:03:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:55,929 INFO L93 Difference]: Finished difference Result 411 states and 587 transitions. [2025-02-06 04:03:55,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:03:55,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2025-02-06 04:03:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:55,930 INFO L225 Difference]: With dead ends: 411 [2025-02-06 04:03:55,930 INFO L226 Difference]: Without dead ends: 220 [2025-02-06 04:03:55,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:03:55,931 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 184 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:55,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 481 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:03:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-02-06 04:03:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 194. [2025-02-06 04:03:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 174 states have (on average 1.4022988505747127) internal successors, (244), 174 states have internal predecessors, (244), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:03:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 276 transitions. [2025-02-06 04:03:55,958 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 276 transitions. Word has length 134 [2025-02-06 04:03:55,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:55,958 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 276 transitions. [2025-02-06 04:03:55,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:03:55,959 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 276 transitions. [2025-02-06 04:03:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 04:03:55,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:55,960 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:03:55,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 04:03:55,960 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:55,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash -682823562, now seen corresponding path program 1 times [2025-02-06 04:03:55,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:55,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231372591] [2025-02-06 04:03:55,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:55,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:55,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 04:03:55,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 04:03:55,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:55,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:03:56,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:56,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231372591] [2025-02-06 04:03:56,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231372591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:56,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:56,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:03:56,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540983580] [2025-02-06 04:03:56,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:56,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:03:56,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:56,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:03:56,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:03:56,249 INFO L87 Difference]: Start difference. First operand 194 states and 276 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:03:56,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:56,653 INFO L93 Difference]: Finished difference Result 250 states and 345 transitions. [2025-02-06 04:03:56,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:03:56,654 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 134 [2025-02-06 04:03:56,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:56,656 INFO L225 Difference]: With dead ends: 250 [2025-02-06 04:03:56,656 INFO L226 Difference]: Without dead ends: 248 [2025-02-06 04:03:56,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:03:56,658 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 221 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:56,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 550 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:03:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-06 04:03:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 226. [2025-02-06 04:03:56,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 206 states have (on average 1.3640776699029127) internal successors, (281), 206 states have internal predecessors, (281), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:03:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 313 transitions. [2025-02-06 04:03:56,679 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 313 transitions. Word has length 134 [2025-02-06 04:03:56,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:56,681 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 313 transitions. [2025-02-06 04:03:56,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:03:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 313 transitions. [2025-02-06 04:03:56,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 04:03:56,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:56,682 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:03:56,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 04:03:56,682 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:56,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:56,682 INFO L85 PathProgramCache]: Analyzing trace with hash 980363942, now seen corresponding path program 1 times [2025-02-06 04:03:56,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:56,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107637001] [2025-02-06 04:03:56,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:56,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:56,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 04:03:56,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 04:03:56,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:56,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:03:58,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:58,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107637001] [2025-02-06 04:03:58,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107637001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:58,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:58,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-06 04:03:58,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114093441] [2025-02-06 04:03:58,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:58,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 04:03:58,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:58,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 04:03:58,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:03:58,238 INFO L87 Difference]: Start difference. First operand 226 states and 313 transitions. Second operand has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 04:03:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:59,509 INFO L93 Difference]: Finished difference Result 557 states and 781 transitions. [2025-02-06 04:03:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:03:59,510 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 135 [2025-02-06 04:03:59,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:59,511 INFO L225 Difference]: With dead ends: 557 [2025-02-06 04:03:59,512 INFO L226 Difference]: Without dead ends: 334 [2025-02-06 04:03:59,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2025-02-06 04:03:59,513 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 437 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:59,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 757 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 04:03:59,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-02-06 04:03:59,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 309. [2025-02-06 04:03:59,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 289 states have (on average 1.397923875432526) internal successors, (404), 289 states have internal predecessors, (404), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:03:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 436 transitions. [2025-02-06 04:03:59,535 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 436 transitions. Word has length 135 [2025-02-06 04:03:59,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:59,535 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 436 transitions. [2025-02-06 04:03:59,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.625) internal successors, (58), 17 states have internal predecessors, (58), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-06 04:03:59,535 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 436 transitions. [2025-02-06 04:03:59,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 04:03:59,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:59,536 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:03:59,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 04:03:59,536 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:59,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:59,537 INFO L85 PathProgramCache]: Analyzing trace with hash 422883404, now seen corresponding path program 1 times [2025-02-06 04:03:59,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:59,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455459214] [2025-02-06 04:03:59,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:59,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:59,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 04:03:59,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 04:03:59,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:59,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:03:59,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:59,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455459214] [2025-02-06 04:03:59,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455459214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:59,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:59,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:03:59,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513459440] [2025-02-06 04:03:59,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:59,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:03:59,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:59,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:03:59,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:03:59,821 INFO L87 Difference]: Start difference. First operand 309 states and 436 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:04:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:00,133 INFO L93 Difference]: Finished difference Result 668 states and 935 transitions. [2025-02-06 04:04:00,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:04:00,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-02-06 04:04:00,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:00,135 INFO L225 Difference]: With dead ends: 668 [2025-02-06 04:04:00,135 INFO L226 Difference]: Without dead ends: 362 [2025-02-06 04:04:00,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:04:00,136 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 323 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:04:00,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 346 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:04:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-06 04:04:00,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 334. [2025-02-06 04:04:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 314 states have (on average 1.372611464968153) internal successors, (431), 314 states have internal predecessors, (431), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:04:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 463 transitions. [2025-02-06 04:04:00,158 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 463 transitions. Word has length 136 [2025-02-06 04:04:00,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:00,159 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 463 transitions. [2025-02-06 04:04:00,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-02-06 04:04:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 463 transitions. [2025-02-06 04:04:00,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 04:04:00,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:00,160 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:04:00,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 04:04:00,160 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:00,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:00,160 INFO L85 PathProgramCache]: Analyzing trace with hash 712555435, now seen corresponding path program 1 times [2025-02-06 04:04:00,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:04:00,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658390140] [2025-02-06 04:04:00,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:00,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:04:00,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 04:04:00,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 04:04:00,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:00,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:04:01,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:04:01,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658390140] [2025-02-06 04:04:01,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658390140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:04:01,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:04:01,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 04:04:01,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651743033] [2025-02-06 04:04:01,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:04:01,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:04:01,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:04:01,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:04:01,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:04:01,262 INFO L87 Difference]: Start difference. First operand 334 states and 463 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:04:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:02,263 INFO L93 Difference]: Finished difference Result 679 states and 938 transitions. [2025-02-06 04:04:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 04:04:02,264 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2025-02-06 04:04:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:02,265 INFO L225 Difference]: With dead ends: 679 [2025-02-06 04:04:02,265 INFO L226 Difference]: Without dead ends: 348 [2025-02-06 04:04:02,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-02-06 04:04:02,267 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 179 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 04:04:02,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 536 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 04:04:02,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-02-06 04:04:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 336. [2025-02-06 04:04:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 316 states have (on average 1.370253164556962) internal successors, (433), 316 states have internal predecessors, (433), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:04:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 465 transitions. [2025-02-06 04:04:02,289 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 465 transitions. Word has length 136 [2025-02-06 04:04:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:02,289 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 465 transitions. [2025-02-06 04:04:02,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:04:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 465 transitions. [2025-02-06 04:04:02,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-06 04:04:02,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:02,290 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:04:02,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 04:04:02,290 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:02,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:02,291 INFO L85 PathProgramCache]: Analyzing trace with hash 2066530757, now seen corresponding path program 1 times [2025-02-06 04:04:02,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:04:02,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974097083] [2025-02-06 04:04:02,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:02,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:04:02,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-06 04:04:02,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-06 04:04:02,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:02,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-02-06 04:04:02,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:04:02,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974097083] [2025-02-06 04:04:02,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974097083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:04:02,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:04:02,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:04:02,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214501681] [2025-02-06 04:04:02,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:04:02,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:04:02,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:04:02,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:04:02,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:04:02,680 INFO L87 Difference]: Start difference. First operand 336 states and 465 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:04:03,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:03,192 INFO L93 Difference]: Finished difference Result 695 states and 961 transitions. [2025-02-06 04:04:03,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:04:03,192 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2025-02-06 04:04:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:03,194 INFO L225 Difference]: With dead ends: 695 [2025-02-06 04:04:03,197 INFO L226 Difference]: Without dead ends: 362 [2025-02-06 04:04:03,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-06 04:04:03,198 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 257 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:04:03,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 353 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:04:03,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-06 04:04:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 336. [2025-02-06 04:04:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 316 states have (on average 1.3639240506329113) internal successors, (431), 316 states have internal predecessors, (431), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:04:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 463 transitions. [2025-02-06 04:04:03,244 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 463 transitions. Word has length 136 [2025-02-06 04:04:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:03,244 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 463 transitions. [2025-02-06 04:04:03,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:04:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 463 transitions. [2025-02-06 04:04:03,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 04:04:03,245 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:03,245 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:04:03,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 04:04:03,245 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:03,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:03,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1480077533, now seen corresponding path program 1 times [2025-02-06 04:04:03,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:04:03,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766872987] [2025-02-06 04:04:03,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:03,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:04:03,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 04:04:03,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 04:04:03,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:03,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:04:03,322 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:04:03,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 04:04:03,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 04:04:03,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:03,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:04:03,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:04:03,440 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:04:03,440 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 04:04:03,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 04:04:03,446 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:04:03,563 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:04:03,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:04:03 BoogieIcfgContainer [2025-02-06 04:04:03,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:04:03,566 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:04:03,566 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:04:03,566 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:04:03,567 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:03:06" (3/4) ... [2025-02-06 04:04:03,568 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 04:04:03,569 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:04:03,569 INFO L158 Benchmark]: Toolchain (without parser) took 58474.98ms. Allocated memory was 167.8MB in the beginning and 956.3MB in the end (delta: 788.5MB). Free memory was 133.6MB in the beginning and 489.4MB in the end (delta: -355.8MB). Peak memory consumption was 432.0MB. Max. memory is 16.1GB. [2025-02-06 04:04:03,569 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:04:03,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.56ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 117.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:04:03,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.04ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 113.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:04:03,570 INFO L158 Benchmark]: Boogie Preprocessor took 57.00ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 111.3MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:04:03,570 INFO L158 Benchmark]: IcfgBuilder took 768.57ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 73.6MB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 04:04:03,570 INFO L158 Benchmark]: TraceAbstraction took 57367.78ms. Allocated memory was 167.8MB in the beginning and 956.3MB in the end (delta: 788.5MB). Free memory was 72.9MB in the beginning and 489.5MB in the end (delta: -416.7MB). Peak memory consumption was 373.3MB. Max. memory is 16.1GB. [2025-02-06 04:04:03,570 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 956.3MB. Free memory was 489.5MB in the beginning and 489.4MB in the end (delta: 162.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:04:03,571 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.56ms. Allocated memory is still 167.8MB. Free memory was 133.2MB in the beginning and 117.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.04ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 113.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.00ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 111.3MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 768.57ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 73.6MB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 57367.78ms. Allocated memory was 167.8MB in the beginning and 956.3MB in the end (delta: 788.5MB). Free memory was 72.9MB in the beginning and 489.5MB in the end (delta: -416.7MB). Peak memory consumption was 373.3MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 956.3MB. Free memory was 489.5MB in the beginning and 489.4MB in the end (delta: 162.3kB). 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 68, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someUnaryFLOAToperation at line 118, overapproximation of someUnaryFLOAToperation at line 68. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -5, 0, 1000, 10, 32, 5, 1.1, 7.8, 1.75, 32, 64, 1230482582 }; [L51] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] signed short int* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L53] signed short int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L54] signed short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L55] signed short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L56] signed long int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L57] float* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L58] float* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L59] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L60] signed long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L61] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L62] signed long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=0] [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] FCALL updateLastVariables() [L126] CALL updateVariables() [L89] WrapperStruct00.var_1_2 = __VERIFIER_nondet_short() [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L92] WrapperStruct00.var_1_3 = __VERIFIER_nondet_short() [L93] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L95] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L96] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L98] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L99] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L101] WrapperStruct00.var_1_7 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_7 [L102] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_7 [L102] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L103] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L105] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L106] EXPR WrapperStruct00.var_1_9 [L106] EXPR WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_9 [L106] EXPR WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L106] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L107] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L109] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_11 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_11 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L111] WrapperStruct00.var_1_12 = __VERIFIER_nondet_long() [L112] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L126] RET updateVariables() [L127] CALL step() [L66] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L66] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L66] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L66] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L66] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))) [L66] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L66] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L66] (*(WrapperStruct00_var_1_1_Pointer)) = ((((((16) > (4)) ? (16) : (4))) + (*(WrapperStruct00_var_1_2_Pointer))) - ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))) [L67] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L67] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L67] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer)) [L68] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L68] EXPR (((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) [L68] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR (((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L68] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L68] COND TRUE (((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) < (*(WrapperStruct00_var_1_9_Pointer)) [L69] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L69] (*(WrapperStruct00_var_1_6_Pointer)) = (*(WrapperStruct00_var_1_3_Pointer)) [L76] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L76] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L76] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L76] EXPR (*(WrapperStruct00_var_1_4_Pointer)) << (*(WrapperStruct00_var_1_2_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L76] signed long int stepLocal_1 = (*(WrapperStruct00_var_1_6_Pointer)) + ((*(WrapperStruct00_var_1_4_Pointer)) << (*(WrapperStruct00_var_1_2_Pointer))); [L77] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L77] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_2_Pointer)) - ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))); [L78] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1, stepLocal_0=-2147483631, stepLocal_1=16] [L78] COND FALSE !(stepLocal_1 != (*(WrapperStruct00_var_1_5_Pointer))) [L85] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L85] (*(WrapperStruct00_var_1_10_Pointer)) = (*(WrapperStruct00_var_1_2_Pointer)) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L118] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))) [L118] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L118] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(WrapperStruct00_var_1_2_Pointer))) - ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) && (((*(WrapperStruct00_var_1_2_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? (((((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_4_Pointer))))) [L118] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? (((((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_4_Pointer)))) [L118] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L118] EXPR (((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) [L118] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L118] EXPR (((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L118] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L118] EXPR ((((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) [L118] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L118] EXPR ((((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? (((((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L118] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(WrapperStruct00_var_1_2_Pointer))) - ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) && (((*(WrapperStruct00_var_1_2_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? (((((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_4_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L118] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(WrapperStruct00_var_1_2_Pointer))) - ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) && (((*(WrapperStruct00_var_1_2_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? (((((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_4_Pointer)))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) + ((*(WrapperStruct00_var_1_4_Pointer)) << (*(WrapperStruct00_var_1_2_Pointer)))) != (*(WrapperStruct00_var_1_5_Pointer))) ? ((((*(WrapperStruct00_var_1_3_Pointer)) / (*(WrapperStruct00_var_1_11_Pointer))) < ((*(WrapperStruct00_var_1_2_Pointer)) - ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((((-256) < ((((((*(WrapperStruct00_var_1_4_Pointer))) < ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_2_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_2_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_2_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_2_Pointer)))))))))) ? (-256) : ((((((*(WrapperStruct00_var_1_4_Pointer))) < ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_2_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_2_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_2_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_2_Pointer))))))))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_4_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_2_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L118-L119] return (((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + (*(WrapperStruct00_var_1_2_Pointer))) - ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))))))))) && (((*(WrapperStruct00_var_1_2_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? (((((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_4_Pointer)))))) && ((((*(WrapperStruct00_var_1_6_Pointer)) + ((*(WrapperStruct00_var_1_4_Pointer)) << (*(WrapperStruct00_var_1_2_Pointer)))) != (*(WrapperStruct00_var_1_5_Pointer))) ? ((((*(WrapperStruct00_var_1_3_Pointer)) / (*(WrapperStruct00_var_1_11_Pointer))) < ((*(WrapperStruct00_var_1_2_Pointer)) - ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((((-256) < ((((((*(WrapperStruct00_var_1_4_Pointer))) < ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_2_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_2_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_2_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_2_Pointer)))))))))) ? (-256) : ((((((*(WrapperStruct00_var_1_4_Pointer))) < ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_2_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_2_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_2_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_2_Pointer))))))))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_4_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_2_Pointer))))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:26}, WrapperStruct00_var_1_11_Pointer={4:30}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:6}, WrapperStruct00_var_1_5_Pointer={4:8}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:22}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 57.2s, OverallIterations: 16, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5630 SdHoareTripleChecker+Valid, 13.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5626 mSDsluCounter, 9903 SdHoareTripleChecker+Invalid, 11.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8093 mSDsCounter, 349 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14144 IncrementalHoareTripleChecker+Invalid, 14493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 349 mSolverCounterUnsat, 1810 mSDtfsCounter, 14144 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 601 GetRequests, 344 SyntacticMatches, 1 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=336occurred in iteration=14, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 630 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 33.2s InterpolantComputationTime, 2364 NumberOfCodeBlocks, 2364 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2210 ConstructedInterpolants, 6 QuantifiedInterpolants, 43440 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1042 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 7946/8160 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-02-06 04:04:03,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 9000cc374a0af085b03570a511ad19fd711a120ab7f5d5a9a2c4565265355a73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:04:05,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:04:05,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 04:04:05,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:04:05,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:04:05,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:04:05,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:04:05,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:04:05,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:04:05,706 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:04:05,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:04:05,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:04:05,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:04:05,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:04:05,711 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:04:05,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:04:05,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:04:05,711 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:04:05,711 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:04:05,711 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:04:05,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:04:05,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:04:05,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:04:05,711 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 04:04:05,711 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 04:04:05,711 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 04:04:05,711 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:04:05,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:04:05,712 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:04:05,712 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:04:05,712 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:04:05,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:04:05,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:04:05,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:04:05,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:04:05,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:04:05,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:04:05,712 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:04:05,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:04:05,712 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 04:04:05,712 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 04:04:05,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:04:05,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:04:05,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:04:05,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:04:05,715 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-jdk21/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 -> 9000cc374a0af085b03570a511ad19fd711a120ab7f5d5a9a2c4565265355a73 [2025-02-06 04:04:05,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:04:05,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:04:05,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:04:05,950 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:04:05,951 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:04:05,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i [2025-02-06 04:04:07,157 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7f187fd3/3ef3c99408614998bea6a1618c9f35ca/FLAGefc0a7274 [2025-02-06 04:04:07,421 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:04:07,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i [2025-02-06 04:04:07,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7f187fd3/3ef3c99408614998bea6a1618c9f35ca/FLAGefc0a7274 [2025-02-06 04:04:07,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b7f187fd3/3ef3c99408614998bea6a1618c9f35ca [2025-02-06 04:04:07,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:04:07,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:04:07,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:04:07,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:04:07,749 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:04:07,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:04:07" (1/1) ... [2025-02-06 04:04:07,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48db98d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:07, skipping insertion in model container [2025-02-06 04:04:07,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:04:07" (1/1) ... [2025-02-06 04:04:07,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:04:07,876 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i[917,930] [2025-02-06 04:04:07,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:04:07,959 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:04:07,968 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-39.i[917,930] [2025-02-06 04:04:08,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:04:08,030 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:04:08,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:08 WrapperNode [2025-02-06 04:04:08,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:04:08,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:04:08,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:04:08,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:04:08,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:08" (1/1) ... [2025-02-06 04:04:08,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:08" (1/1) ... [2025-02-06 04:04:08,093 INFO L138 Inliner]: procedures = 37, calls = 188, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 590 [2025-02-06 04:04:08,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:04:08,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:04:08,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:04:08,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:04:08,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:08" (1/1) ... [2025-02-06 04:04:08,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:08" (1/1) ... [2025-02-06 04:04:08,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:08" (1/1) ... [2025-02-06 04:04:08,135 INFO L175 MemorySlicer]: Split 161 memory accesses to 2 slices as follows [2, 159]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2025-02-06 04:04:08,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:08" (1/1) ... [2025-02-06 04:04:08,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:08" (1/1) ... [2025-02-06 04:04:08,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:08" (1/1) ... [2025-02-06 04:04:08,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:08" (1/1) ... [2025-02-06 04:04:08,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:08" (1/1) ... [2025-02-06 04:04:08,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:08" (1/1) ... [2025-02-06 04:04:08,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:04:08,174 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:04:08,174 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:04:08,175 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:04:08,179 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:08" (1/1) ... [2025-02-06 04:04:08,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:04:08,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:04:08,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:04:08,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:04:08,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:04:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 04:04:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 04:04:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 04:04:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 04:04:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 04:04:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 04:04:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 04:04:08,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 04:04:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 04:04:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 04:04:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 04:04:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 04:04:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 04:04:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 04:04:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 04:04:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 04:04:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 04:04:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 04:04:08,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:04:08,245 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:04:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 04:04:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 04:04:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:04:08,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:04:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 04:04:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 04:04:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 04:04:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 04:04:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 04:04:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 04:04:08,366 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:04:08,368 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:04:09,715 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem112#1;havoc property_#t~mem105#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite130#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite121#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem120#1;havoc property_#t~mem122#1;havoc property_#t~ite127#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem135#1;havoc property_#t~ite174#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~mem140#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~ite171#1;havoc property_#t~mem168#1;havoc property_#t~mem146#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~ite145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite153#1;havoc property_#t~mem147#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite152#1;havoc property_#t~mem150#1;havoc property_#t~mem151#1;havoc property_#t~ite167#1;havoc property_#t~mem159#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~ite158#1;havoc property_#t~mem156#1;havoc property_#t~mem157#1;havoc property_#t~ite166#1;havoc property_#t~mem160#1;havoc property_#t~mem161#1;havoc property_#t~mem162#1;havoc property_#t~ite165#1;havoc property_#t~mem163#1;havoc property_#t~mem164#1;havoc property_#t~mem170#1;havoc property_#t~mem169#1;havoc property_#t~mem173#1;havoc property_#t~mem172#1;havoc property_#t~short175#1; [2025-02-06 04:04:09,755 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2025-02-06 04:04:09,755 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:04:09,764 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:04:09,765 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:04:09,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:04:09 BoogieIcfgContainer [2025-02-06 04:04:09,766 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:04:09,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:04:09,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:04:09,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:04:09,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:04:07" (1/3) ... [2025-02-06 04:04:09,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156a40c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:04:09, skipping insertion in model container [2025-02-06 04:04:09,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:04:08" (2/3) ... [2025-02-06 04:04:09,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156a40c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:04:09, skipping insertion in model container [2025-02-06 04:04:09,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:04:09" (3/3) ... [2025-02-06 04:04:09,775 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-39.i [2025-02-06 04:04:09,784 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:04:09,785 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-39.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:04:09,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:04:09,859 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;@102e4f6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:04:09,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:04:09,865 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 95 states have internal predecessors, (135), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:04:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 04:04:09,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:09,874 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:04:09,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:09,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash 177666817, now seen corresponding path program 1 times [2025-02-06 04:04:09,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:04:09,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527151362] [2025-02-06 04:04:09,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:09,889 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-02-06 04:04:09,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:04:09,897 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-06 04:04:09,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 04:04:10,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 04:04:10,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 04:04:10,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:10,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:10,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:04:10,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2025-02-06 04:04:10,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:04:10,250 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:04:10,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527151362] [2025-02-06 04:04:10,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527151362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:04:10,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:04:10,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:04:10,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536039190] [2025-02-06 04:04:10,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:04:10,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:04:10,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:04:10,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:04:10,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:04:10,268 INFO L87 Difference]: Start difference. First operand has 113 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 95 states have internal predecessors, (135), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:04:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:10,286 INFO L93 Difference]: Finished difference Result 220 states and 345 transitions. [2025-02-06 04:04:10,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:04:10,287 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2025-02-06 04:04:10,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:10,291 INFO L225 Difference]: With dead ends: 220 [2025-02-06 04:04:10,292 INFO L226 Difference]: Without dead ends: 110 [2025-02-06 04:04:10,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-02-06 04:04:10,296 INFO L435 NwaCegarLoop]: 162 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, 162 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-02-06 04:04:10,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:04:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-06 04:04:10,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-02-06 04:04:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:04:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2025-02-06 04:04:10,334 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 126 [2025-02-06 04:04:10,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:10,335 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2025-02-06 04:04:10,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:04:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2025-02-06 04:04:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 04:04:10,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:10,337 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:04:10,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 04:04:10,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-06 04:04:10,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:10,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:10,542 INFO L85 PathProgramCache]: Analyzing trace with hash 526403747, now seen corresponding path program 1 times [2025-02-06 04:04:10,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:04:10,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044357290] [2025-02-06 04:04:10,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:10,542 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-02-06 04:04:10,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:04:10,545 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-06 04:04:10,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 04:04:10,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 04:04:10,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 04:04:10,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:10,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:10,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:04:10,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-02-06 04:04:10,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:04:10,853 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:04:10,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044357290] [2025-02-06 04:04:10,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044357290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:04:10,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:04:10,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:04:10,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431622903] [2025-02-06 04:04:10,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:04:10,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:04:10,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:04:10,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:04:10,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:04:10,855 INFO L87 Difference]: Start difference. First operand 110 states and 162 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:04:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:04:10,891 INFO L93 Difference]: Finished difference Result 219 states and 324 transitions. [2025-02-06 04:04:10,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:04:10,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 126 [2025-02-06 04:04:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:04:10,893 INFO L225 Difference]: With dead ends: 219 [2025-02-06 04:04:10,893 INFO L226 Difference]: Without dead ends: 112 [2025-02-06 04:04:10,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 123 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-02-06 04:04:10,893 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:04:10,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 469 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:04:10,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-06 04:04:10,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-06 04:04:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 04:04:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2025-02-06 04:04:10,900 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 126 [2025-02-06 04:04:10,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:04:10,901 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2025-02-06 04:04:10,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-02-06 04:04:10,901 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2025-02-06 04:04:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 04:04:10,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:04:10,902 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 04:04:10,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 04:04:11,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-06 04:04:11,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:04:11,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:04:11,108 INFO L85 PathProgramCache]: Analyzing trace with hash -166988958, now seen corresponding path program 1 times [2025-02-06 04:04:11,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:04:11,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620011828] [2025-02-06 04:04:11,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:04:11,108 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-02-06 04:04:11,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:04:11,110 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-06 04:04:11,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 04:04:11,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 04:04:11,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 04:04:11,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:11,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:11,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-06 04:04:11,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:11,858 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-02-06 04:04:13,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 04:04:13,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2025-02-06 04:04:14,546 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 [2025-02-06 04:04:15,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-02-06 04:04:15,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-02-06 04:04:16,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-02-06 04:04:16,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2025-02-06 04:04:18,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2025-02-06 04:04:19,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2025-02-06 04:04:19,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 85 [2025-02-06 04:04:19,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 109 [2025-02-06 04:04:19,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:04:19,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 132 treesize of output 84 [2025-02-06 04:04:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 257 proven. 151 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-06 04:04:19,946 INFO L312 TraceCheckSpWp]: Computing backward predicates...