./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.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-95.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 e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:10:35,085 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:10:35,158 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:10:35,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:10:35,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:10:35,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:10:35,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:10:35,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:10:35,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:10:35,197 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:10:35,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:10:35,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:10:35,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:10:35,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:10:35,199 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:10:35,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:10:35,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:10:35,199 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:10:35,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:10:35,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:10:35,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:10:35,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:10:35,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:10:35,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:10:35,200 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:10:35,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:10:35,200 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:10:35,200 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:10:35,201 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:10:35,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:10:35,201 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:10:35,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:10:35,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:10:35,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:10:35,202 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:10:35,202 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:10:35,202 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:10:35,202 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:10:35,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:10:35,202 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:10:35,202 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:10:35,202 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:10:35,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:10:35,202 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 -> e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd [2025-02-06 04:10:35,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:10:35,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:10:35,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:10:35,462 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:10:35,462 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:10:35,463 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-95.i [2025-02-06 04:10:36,737 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/994077697/7eba6a6a14914443b6951753a03d3085/FLAGce6f4825e [2025-02-06 04:10:37,059 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:10:37,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i [2025-02-06 04:10:37,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/994077697/7eba6a6a14914443b6951753a03d3085/FLAGce6f4825e [2025-02-06 04:10:37,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/994077697/7eba6a6a14914443b6951753a03d3085 [2025-02-06 04:10:37,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:10:37,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:10:37,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:10:37,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:10:37,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:10:37,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:10:37" (1/1) ... [2025-02-06 04:10:37,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bf43500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:37, skipping insertion in model container [2025-02-06 04:10:37,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:10:37" (1/1) ... [2025-02-06 04:10:37,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:10:37,260 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-95.i[917,930] [2025-02-06 04:10:37,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:10:37,345 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:10:37,356 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-95.i[917,930] [2025-02-06 04:10:37,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:10:37,416 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:10:37,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:37 WrapperNode [2025-02-06 04:10:37,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:10:37,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:10:37,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:10:37,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:10:37,425 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:10:37" (1/1) ... [2025-02-06 04:10:37,441 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:10:37" (1/1) ... [2025-02-06 04:10:37,488 INFO L138 Inliner]: procedures = 30, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 487 [2025-02-06 04:10:37,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:10:37,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:10:37,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:10:37,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:10:37,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:37" (1/1) ... [2025-02-06 04:10:37,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:37" (1/1) ... [2025-02-06 04:10:37,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:37" (1/1) ... [2025-02-06 04:10:37,521 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 04:10:37,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:37" (1/1) ... [2025-02-06 04:10:37,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:37" (1/1) ... [2025-02-06 04:10:37,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:37" (1/1) ... [2025-02-06 04:10:37,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:37" (1/1) ... [2025-02-06 04:10:37,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:37" (1/1) ... [2025-02-06 04:10:37,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:37" (1/1) ... [2025-02-06 04:10:37,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:10:37,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:10:37,570 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:10:37,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:10:37,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:37" (1/1) ... [2025-02-06 04:10:37,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:10:37,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:37,605 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:10:37,608 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:10:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:10:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 04:10:37,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 04:10:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 04:10:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 04:10:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 04:10:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 04:10:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:10:37,633 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:10:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 04:10:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:10:37,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:10:37,760 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:10:37,762 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:10:38,343 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~mem83#1;havoc property_#t~mem89#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite88#1;havoc property_#t~mem87#1;havoc property_#t~short90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~bitwise94#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem99#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~bitwise114#1;havoc property_#t~ite127#1;havoc property_#t~mem119#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short131#1; [2025-02-06 04:10:38,391 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2025-02-06 04:10:38,392 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:10:38,414 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:10:38,414 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:10:38,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:10:38 BoogieIcfgContainer [2025-02-06 04:10:38,415 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:10:38,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:10:38,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:10:38,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:10:38,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:10:37" (1/3) ... [2025-02-06 04:10:38,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e3df80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:10:38, skipping insertion in model container [2025-02-06 04:10:38,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:37" (2/3) ... [2025-02-06 04:10:38,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e3df80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:10:38, skipping insertion in model container [2025-02-06 04:10:38,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:10:38" (3/3) ... [2025-02-06 04:10:38,427 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-95.i [2025-02-06 04:10:38,438 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:10:38,439 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-95.i that has 2 procedures, 113 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:10:38,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:10:38,498 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;@767f783b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:10:38,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:10:38,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 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:10:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 04:10:38,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:38,514 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] [2025-02-06 04:10:38,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:38,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:38,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1889197682, now seen corresponding path program 1 times [2025-02-06 04:10:38,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:38,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82826481] [2025-02-06 04:10:38,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:38,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:38,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 04:10:38,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 04:10:38,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:38,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:38,939 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:10:38,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:38,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82826481] [2025-02-06 04:10:38,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82826481] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:38,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468564228] [2025-02-06 04:10:38,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:38,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:38,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:38,947 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:10:38,949 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:10:39,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 04:10:39,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 04:10:39,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:39,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:39,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:10:39,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:39,273 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:10:39,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:10:39,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468564228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:39,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:10:39,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:10:39,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535358980] [2025-02-06 04:10:39,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:39,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:10:39,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:39,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:10:39,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:10:39,298 INFO L87 Difference]: Start difference. First operand has 113 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 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 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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:10:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:39,327 INFO L93 Difference]: Finished difference Result 220 states and 341 transitions. [2025-02-06 04:10:39,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:10:39,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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 132 [2025-02-06 04:10:39,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:39,334 INFO L225 Difference]: With dead ends: 220 [2025-02-06 04:10:39,334 INFO L226 Difference]: Without dead ends: 110 [2025-02-06 04:10:39,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:10:39,340 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:39,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:10:39,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-06 04:10:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-02-06 04:10:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 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:10:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2025-02-06 04:10:39,385 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 132 [2025-02-06 04:10:39,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:39,385 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2025-02-06 04:10:39,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 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:10:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2025-02-06 04:10:39,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 04:10:39,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:39,390 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] [2025-02-06 04:10:39,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:10:39,591 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:10:39,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:39,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2057648480, now seen corresponding path program 1 times [2025-02-06 04:10:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:39,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970963631] [2025-02-06 04:10:39,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:39,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:39,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 04:10:39,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 04:10:39,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:39,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:40,007 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:10:40,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:40,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970963631] [2025-02-06 04:10:40,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970963631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:40,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:40,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:10:40,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462503996] [2025-02-06 04:10:40,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:40,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:10:40,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:40,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:10:40,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:10:40,010 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:10:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:40,073 INFO L93 Difference]: Finished difference Result 220 states and 313 transitions. [2025-02-06 04:10:40,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:10:40,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 132 [2025-02-06 04:10:40,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:40,078 INFO L225 Difference]: With dead ends: 220 [2025-02-06 04:10:40,078 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 04:10:40,078 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:10:40,079 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:40,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 438 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:10:40,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 04:10:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-02-06 04:10:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 94 states have internal predecessors, (126), 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:10:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2025-02-06 04:10:40,093 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 132 [2025-02-06 04:10:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:40,095 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2025-02-06 04:10:40,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:10:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2025-02-06 04:10:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 04:10:40,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:40,097 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] [2025-02-06 04:10:40,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:10:40,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:40,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:40,098 INFO L85 PathProgramCache]: Analyzing trace with hash -2056724959, now seen corresponding path program 1 times [2025-02-06 04:10:40,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:40,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007814334] [2025-02-06 04:10:40,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:40,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:40,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 04:10:40,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 04:10:40,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:40,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:41,829 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:10:41,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:41,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007814334] [2025-02-06 04:10:41,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007814334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:41,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:41,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:10:41,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325920455] [2025-02-06 04:10:41,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:41,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 04:10:41,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:41,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 04:10:41,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 04:10:41,834 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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:10:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:42,444 INFO L93 Difference]: Finished difference Result 265 states and 374 transitions. [2025-02-06 04:10:42,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:10:42,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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 132 [2025-02-06 04:10:42,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:42,447 INFO L225 Difference]: With dead ends: 265 [2025-02-06 04:10:42,449 INFO L226 Difference]: Without dead ends: 156 [2025-02-06 04:10:42,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:10:42,451 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 357 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:42,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 359 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 04:10:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-06 04:10:42,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 121. [2025-02-06 04:10:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 103 states have internal predecessors, (139), 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:10:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 171 transitions. [2025-02-06 04:10:42,475 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 171 transitions. Word has length 132 [2025-02-06 04:10:42,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:42,476 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 171 transitions. [2025-02-06 04:10:42,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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:10:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 171 transitions. [2025-02-06 04:10:42,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-06 04:10:42,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:42,478 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:10:42,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:10:42,478 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:42,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:42,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1773741697, now seen corresponding path program 1 times [2025-02-06 04:10:42,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:42,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910645751] [2025-02-06 04:10:42,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:42,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:42,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 04:10:42,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 04:10:42,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:42,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:44,892 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:10:44,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:44,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910645751] [2025-02-06 04:10:44,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910645751] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:44,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946211440] [2025-02-06 04:10:44,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:44,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:44,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:44,895 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:10:44,898 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:10:45,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 04:10:46,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 04:10:46,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:46,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:46,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-06 04:10:46,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:47,015 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:10:47,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:10:47,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:10:48,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:10:48,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:10:49,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:10:49,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:49,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:10:49,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:49,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:49,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 13 [2025-02-06 04:10:49,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 04:10:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 139 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-02-06 04:10:49,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:10:49,794 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_582 Int) (v_ArrVal_581 (Array Int Int))) (or (< 0 (mod (+ 943286515 (select (select (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_3_Pointer~0.base v_ArrVal_581))) (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_582))) c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) 4294967296)) (not (= v_ArrVal_581 (store (select |c_#memory_int| c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset (select v_ArrVal_581 c_~WrapperStruct00_var_1_3_Pointer~0.offset)))))) is different from false [2025-02-06 04:10:49,840 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_582 Int) (v_ArrVal_581 (Array Int Int)) (v_ArrVal_579 Int)) (let ((.cse1 (store |c_#memory_int| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_579)))) (or (< 0 (mod (+ 943286515 (select (select (let ((.cse0 (store .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base v_ArrVal_581))) (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset v_ArrVal_582))) c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) 4294967296)) (not (= v_ArrVal_581 (store (select .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset (select v_ArrVal_581 c_~WrapperStruct00_var_1_3_Pointer~0.offset))))))) is different from false [2025-02-06 04:10:49,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946211440] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:49,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:10:49,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2025-02-06 04:10:49,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283260355] [2025-02-06 04:10:49,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 04:10:49,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 04:10:49,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:49,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 04:10:49,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=543, Unknown=2, NotChecked=98, Total=756 [2025-02-06 04:10:49,884 INFO L87 Difference]: Start difference. First operand 121 states and 171 transitions. Second operand has 23 states, 21 states have (on average 5.142857142857143) internal successors, (108), 23 states have internal predecessors, (108), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 9 states have call successors, (32) [2025-02-06 04:10:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:51,159 INFO L93 Difference]: Finished difference Result 308 states and 432 transitions. [2025-02-06 04:10:51,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 04:10:51,159 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 5.142857142857143) internal successors, (108), 23 states have internal predecessors, (108), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 9 states have call successors, (32) Word has length 134 [2025-02-06 04:10:51,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:51,161 INFO L225 Difference]: With dead ends: 308 [2025-02-06 04:10:51,161 INFO L226 Difference]: Without dead ends: 190 [2025-02-06 04:10:51,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=224, Invalid=838, Unknown=2, NotChecked=126, Total=1190 [2025-02-06 04:10:51,162 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 522 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:51,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 846 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 04:10:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-06 04:10:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 183. [2025-02-06 04:10:51,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 161 states have (on average 1.360248447204969) internal successors, (219), 162 states have internal predecessors, (219), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 04:10:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 257 transitions. [2025-02-06 04:10:51,184 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 257 transitions. Word has length 134 [2025-02-06 04:10:51,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:51,184 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 257 transitions. [2025-02-06 04:10:51,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 5.142857142857143) internal successors, (108), 23 states have internal predecessors, (108), 9 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 9 states have call successors, (32) [2025-02-06 04:10:51,185 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 257 transitions. [2025-02-06 04:10:51,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 04:10:51,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:51,186 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:10:51,198 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:10:51,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:51,387 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:51,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:51,388 INFO L85 PathProgramCache]: Analyzing trace with hash 208288752, now seen corresponding path program 1 times [2025-02-06 04:10:51,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:51,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185891376] [2025-02-06 04:10:51,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:51,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:51,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 04:10:51,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 04:10:51,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:51,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:52,564 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:10:52,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:52,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185891376] [2025-02-06 04:10:52,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185891376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:52,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:52,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:10:52,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287901329] [2025-02-06 04:10:52,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:52,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:10:52,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:52,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:10:52,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:10:52,568 INFO L87 Difference]: Start difference. First operand 183 states and 257 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 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:10:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:53,337 INFO L93 Difference]: Finished difference Result 364 states and 512 transitions. [2025-02-06 04:10:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:10:53,338 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 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 135 [2025-02-06 04:10:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:53,341 INFO L225 Difference]: With dead ends: 364 [2025-02-06 04:10:53,341 INFO L226 Difference]: Without dead ends: 184 [2025-02-06 04:10:53,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:10:53,344 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 180 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:53,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 320 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 04:10:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-06 04:10:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 179. [2025-02-06 04:10:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 157 states have (on average 1.356687898089172) internal successors, (213), 158 states have internal predecessors, (213), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 04:10:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 251 transitions. [2025-02-06 04:10:53,366 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 251 transitions. Word has length 135 [2025-02-06 04:10:53,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:53,366 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 251 transitions. [2025-02-06 04:10:53,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 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:10:53,367 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 251 transitions. [2025-02-06 04:10:53,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 04:10:53,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:53,368 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:10:53,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:10:53,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:53,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:53,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2045869196, now seen corresponding path program 1 times [2025-02-06 04:10:53,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:53,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117413503] [2025-02-06 04:10:53,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:53,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:53,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 04:10:53,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 04:10:53,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:53,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:54,110 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:10:54,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:54,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117413503] [2025-02-06 04:10:54,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117413503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:54,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:54,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:10:54,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959276083] [2025-02-06 04:10:54,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:54,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:10:54,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:54,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:10:54,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:10:54,114 INFO L87 Difference]: Start difference. First operand 179 states and 251 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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:10:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:54,636 INFO L93 Difference]: Finished difference Result 487 states and 680 transitions. [2025-02-06 04:10:54,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:10:54,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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 135 [2025-02-06 04:10:54,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:54,640 INFO L225 Difference]: With dead ends: 487 [2025-02-06 04:10:54,641 INFO L226 Difference]: Without dead ends: 300 [2025-02-06 04:10:54,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:10:54,643 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 157 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:54,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 540 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:10:54,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-02-06 04:10:54,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 242. [2025-02-06 04:10:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 202 states have (on average 1.3366336633663367) internal successors, (270), 203 states have internal predecessors, (270), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-06 04:10:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 340 transitions. [2025-02-06 04:10:54,677 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 340 transitions. Word has length 135 [2025-02-06 04:10:54,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:54,678 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 340 transitions. [2025-02-06 04:10:54,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 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:10:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 340 transitions. [2025-02-06 04:10:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 04:10:54,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:54,680 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:10:54,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:10:54,681 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:54,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1650982798, now seen corresponding path program 1 times [2025-02-06 04:10:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:54,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502295893] [2025-02-06 04:10:54,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:54,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:54,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 04:10:54,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 04:10:54,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:54,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 04:10:54,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [930556017] [2025-02-06 04:10:54,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:54,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:54,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:54,953 INFO L229 MonitoredProcess]: Starting monitored process 4 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:10:54,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:10:55,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 04:10:56,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 04:10:56,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:56,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:10:56,919 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:10:56,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 04:10:57,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 04:10:57,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:57,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:10:57,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:10:57,958 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:10:57,959 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 04:10:57,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:10:58,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:58,163 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:58,313 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:10:58,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:10:58 BoogieIcfgContainer [2025-02-06 04:10:58,315 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:10:58,316 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:10:58,316 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:10:58,316 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:10:58,318 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:10:38" (3/4) ... [2025-02-06 04:10:58,320 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 04:10:58,321 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:10:58,322 INFO L158 Benchmark]: Toolchain (without parser) took 21221.50ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 122.1MB in the beginning and 236.5MB in the end (delta: -114.3MB). Peak memory consumption was 115.6MB. Max. memory is 16.1GB. [2025-02-06 04:10:58,322 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:10:58,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.97ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 106.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:10:58,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.98ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 102.3MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:10:58,323 INFO L158 Benchmark]: Boogie Preprocessor took 77.33ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 99.7MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:10:58,324 INFO L158 Benchmark]: IcfgBuilder took 845.16ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 62.4MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 04:10:58,324 INFO L158 Benchmark]: TraceAbstraction took 19896.83ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 61.6MB in the beginning and 236.5MB in the end (delta: -174.9MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2025-02-06 04:10:58,324 INFO L158 Benchmark]: Witness Printer took 5.61ms. Allocated memory is still 394.3MB. Free memory was 236.5MB in the beginning and 236.5MB in the end (delta: 81.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:10:58,325 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.18ms. Allocated memory is still 201.3MB. Free memory is still 121.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.97ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 106.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.98ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 102.3MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 77.33ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 99.7MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 845.16ms. Allocated memory is still 167.8MB. Free memory was 99.7MB in the beginning and 62.4MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19896.83ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 61.6MB in the beginning and 236.5MB in the end (delta: -174.9MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. * Witness Printer took 5.61ms. Allocated memory is still 394.3MB. Free memory was 236.5MB in the beginning and 236.5MB in the end (delta: 81.1kB). Peak memory consumption was 8.4MB. 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 94, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryArithmeticFLOAToperation at line 74. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L55] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L57] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L58] float* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L59] float* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L60] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L61] unsigned long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L62] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L63] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L64] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L65] signed short int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L66] unsigned long int* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L67] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L68] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L69] unsigned char last_1_WrapperStruct00_var_1_7 = 0; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=0, last_1_WrapperStruct00_var_1_7=0] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L118] EXPR WrapperStruct00.var_1_7 [L118] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L91] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L92] EXPR WrapperStruct00.var_1_4 [L92] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_4 [L92] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L95] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_6 [L96] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_6 [L96] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_ulong() [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L100] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L102] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L103] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L105] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L106] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L108] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L109] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ulong() [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L111] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L112] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L113] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L114] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L115] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L129] RET updateVariables() [L130] CALL step() [L73] (*(WrapperStruct00_var_1_1_Pointer)) = ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))) [L74] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L74] EXPR ((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L74] (*(WrapperStruct00_var_1_3_Pointer)) = (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))))) [L75] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L75] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L76] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L76] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L76] EXPR (*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L76] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)); [L77] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0, stepLocal_0=0] [L77] COND TRUE (- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > stepLocal_0 [L78] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) [L78] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L78] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) [L78] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L78] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L78] (*(WrapperStruct00_var_1_7_Pointer)) = ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))) [L80] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L80] EXPR (*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L80] COND FALSE !(((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) [L83] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L83] COND TRUE (*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer)) [L84] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L84] (*(WrapperStruct00_var_1_13_Pointer)) = (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))))))) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR ((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121] EXPR (((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L121-L122] return (((((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && ((*(WrapperStruct00_var_1_3_Pointer)) == ((float) (((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))) + ((((256.5f) < (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f))) ? (256.5f) : (((*(WrapperStruct00_var_1_6_Pointer)) - 16.125f)))))))) && (((- (3351680781u - (*(WrapperStruct00_var_1_8_Pointer)))) > ((*(WrapperStruct00_var_1_16_Pointer)) & (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_10_Pointer))) < ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) + (*(WrapperStruct00_var_1_12_Pointer))))) : 1)) && ((((*(WrapperStruct00_var_1_16_Pointer)) / (*(WrapperStruct00_var_1_14_Pointer))) < ((*(WrapperStruct00_var_1_7_Pointer)) >> (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) ((((4 - (*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -(4 - (*(WrapperStruct00_var_1_11_Pointer))) : (4 - (*(WrapperStruct00_var_1_11_Pointer))))))) : (((*(WrapperStruct00_var_1_16_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) (-5 + ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_11_Pointer)))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed short int) 256))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_17_Pointer)))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:25}, WrapperStruct00_var_1_11_Pointer={4:26}, WrapperStruct00_var_1_12_Pointer={4:27}, WrapperStruct00_var_1_13_Pointer={4:28}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_16_Pointer={4:34}, WrapperStruct00_var_1_17_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:16}, WrapperStruct00_var_1_7_Pointer={4:20}, WrapperStruct00_var_1_8_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1223 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1217 mSDsluCounter, 2655 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1926 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2130 IncrementalHoareTripleChecker+Invalid, 2275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 729 mSDtfsCounter, 2130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 106 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 1340 NumberOfCodeBlocks, 1340 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1058 ConstructedInterpolants, 0 QuantifiedInterpolants, 10334 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1093 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 3638/3840 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:10:58,359 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-95.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 e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:11:00,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:11:00,696 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:11:00,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:11:00,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:11:00,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:11:00,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:11:00,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:11:00,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:11:00,738 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:11:00,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:11:00,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:11:00,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:11:00,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:11:00,739 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:11:00,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:11:00,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:11:00,740 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:11:00,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:11:00,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:11:00,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:11:00,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:11:00,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:11:00,741 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 04:11:00,741 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 04:11:00,741 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 04:11:00,741 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:11:00,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:11:00,741 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:11:00,741 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:11:00,741 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:11:00,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:11:00,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:11:00,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:11:00,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:11:00,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:11:00,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:11:00,742 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:11:00,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:11:00,742 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 04:11:00,742 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 04:11:00,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:11:00,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:11:00,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:11:00,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:11:00,742 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 -> e669462867509a48cd8854a2d2c887397834599fcc49707fe1e1ec7fa25ff3cd [2025-02-06 04:11:01,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:11:01,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:11:01,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:11:01,045 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:11:01,046 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:11:01,047 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-95.i [2025-02-06 04:11:02,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d5e7d734/7a5d39f92ee24926a10a658dbe0d4ed9/FLAG2baedda53 [2025-02-06 04:11:02,710 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:11:02,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-95.i [2025-02-06 04:11:02,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d5e7d734/7a5d39f92ee24926a10a658dbe0d4ed9/FLAG2baedda53 [2025-02-06 04:11:02,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d5e7d734/7a5d39f92ee24926a10a658dbe0d4ed9 [2025-02-06 04:11:02,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:11:02,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:11:02,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:11:02,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:11:02,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:11:02,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:11:02" (1/1) ... [2025-02-06 04:11:02,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74085153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:11:02, skipping insertion in model container [2025-02-06 04:11:02,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:11:02" (1/1) ... [2025-02-06 04:11:02,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:11:02,925 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-95.i[917,930] [2025-02-06 04:11:03,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:11:03,033 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:11:03,045 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-95.i[917,930] [2025-02-06 04:11:03,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:11:03,110 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:11:03,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:11:03 WrapperNode [2025-02-06 04:11:03,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:11:03,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:11:03,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:11:03,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:11:03,117 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:11:03" (1/1) ... [2025-02-06 04:11:03,134 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:11:03" (1/1) ... [2025-02-06 04:11:03,179 INFO L138 Inliner]: procedures = 37, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 454 [2025-02-06 04:11:03,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:11:03,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:11:03,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:11:03,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:11:03,188 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:11:03" (1/1) ... [2025-02-06 04:11:03,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:11:03" (1/1) ... [2025-02-06 04:11:03,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:11:03" (1/1) ... [2025-02-06 04:11:03,221 INFO L175 MemorySlicer]: Split 122 memory accesses to 2 slices as follows [2, 120]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2025-02-06 04:11:03,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:11:03" (1/1) ... [2025-02-06 04:11:03,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:11:03" (1/1) ... [2025-02-06 04:11:03,243 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:11:03" (1/1) ... [2025-02-06 04:11:03,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:11:03" (1/1) ... [2025-02-06 04:11:03,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:11:03" (1/1) ... [2025-02-06 04:11:03,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:11:03" (1/1) ... [2025-02-06 04:11:03,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:11:03,273 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:11:03,273 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:11:03,273 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:11:03,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:11:03" (1/1) ... [2025-02-06 04:11:03,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:11:03,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:11:03,305 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:11:03,308 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:11:03,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 04:11:03,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 04:11:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:11:03,330 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:11:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 04:11:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 04:11:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:11:03,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:11:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 04:11:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 04:11:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 04:11:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 04:11:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 04:11:03,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 04:11:03,469 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:11:03,471 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:11:05,729 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L121: havoc property_#t~mem81#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem96#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem103#1;havoc property_#t~short106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite123#1;havoc property_#t~mem115#1;havoc property_#t~mem111#1;havoc property_#t~ite114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite122#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem121#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-02-06 04:11:05,776 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2025-02-06 04:11:05,776 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:11:05,791 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:11:05,791 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:11:05,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:11:05 BoogieIcfgContainer [2025-02-06 04:11:05,792 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:11:05,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:11:05,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:11:05,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:11:05,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:11:02" (1/3) ... [2025-02-06 04:11:05,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2292dc4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:11:05, skipping insertion in model container [2025-02-06 04:11:05,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:11:03" (2/3) ... [2025-02-06 04:11:05,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2292dc4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:11:05, skipping insertion in model container [2025-02-06 04:11:05,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:11:05" (3/3) ... [2025-02-06 04:11:05,806 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-95.i [2025-02-06 04:11:05,817 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:11:05,819 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-95.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:11:05,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:11:05,879 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;@49c35b50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:11:05,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:11:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 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:11:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 04:11:05,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:05,894 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:11:05,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:05,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:05,899 INFO L85 PathProgramCache]: Analyzing trace with hash -188494035, now seen corresponding path program 1 times [2025-02-06 04:11:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:11:05,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027652898] [2025-02-06 04:11:05,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:05,908 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:11:05,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:11:05,911 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:11:05,912 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:11:06,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 04:11:06,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 04:11:06,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:06,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:06,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:11:06,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:11:06,472 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-02-06 04:11:06,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:11:06,474 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:11:06,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027652898] [2025-02-06 04:11:06,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027652898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:06,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:11:06,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:11:06,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380164694] [2025-02-06 04:11:06,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:06,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:11:06,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:11:06,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:11:06,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:11:06,508 INFO L87 Difference]: Start difference. First operand has 102 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 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 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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:11:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:06,539 INFO L93 Difference]: Finished difference Result 198 states and 307 transitions. [2025-02-06 04:11:06,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:11:06,543 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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 129 [2025-02-06 04:11:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:06,551 INFO L225 Difference]: With dead ends: 198 [2025-02-06 04:11:06,551 INFO L226 Difference]: Without dead ends: 99 [2025-02-06 04:11:06,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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:11:06,559 INFO L435 NwaCegarLoop]: 139 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, 139 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:11:06,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:11:06,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-06 04:11:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-06 04:11:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 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:11:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2025-02-06 04:11:06,627 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 129 [2025-02-06 04:11:06,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:06,627 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2025-02-06 04:11:06,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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:11:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2025-02-06 04:11:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 04:11:06,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:06,634 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:11:06,652 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:11:06,835 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:11:06,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:06,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:06,836 INFO L85 PathProgramCache]: Analyzing trace with hash -855862437, now seen corresponding path program 1 times [2025-02-06 04:11:06,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:11:06,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594506335] [2025-02-06 04:11:06,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:06,837 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:11:06,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:11:06,840 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:11:06,842 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:11:06,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 04:11:07,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 04:11:07,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:07,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:07,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 04:11:07,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:11:07,434 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:11:07,434 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:11:07,434 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:11:07,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594506335] [2025-02-06 04:11:07,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594506335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:07,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:11:07,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:11:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180915475] [2025-02-06 04:11:07,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:07,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:11:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:11:07,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:11:07,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:11:07,437 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:11:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:07,893 INFO L93 Difference]: Finished difference Result 202 states and 285 transitions. [2025-02-06 04:11:07,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:11:07,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 129 [2025-02-06 04:11:07,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:07,897 INFO L225 Difference]: With dead ends: 202 [2025-02-06 04:11:07,897 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 04:11:07,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:11:07,899 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:11:07,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 644 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:11:07,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 04:11:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-06 04:11:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 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:11:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 145 transitions. [2025-02-06 04:11:07,922 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 145 transitions. Word has length 129 [2025-02-06 04:11:07,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:07,923 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 145 transitions. [2025-02-06 04:11:07,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:11:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 145 transitions. [2025-02-06 04:11:07,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 04:11:07,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:07,930 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:11:07,948 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-02-06 04:11:08,130 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:11:08,131 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:08,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:08,131 INFO L85 PathProgramCache]: Analyzing trace with hash -854938916, now seen corresponding path program 1 times [2025-02-06 04:11:08,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:11:08,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971812679] [2025-02-06 04:11:08,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:08,132 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:11:08,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:11:08,134 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:11:08,137 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:11:08,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 04:11:08,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 04:11:08,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:08,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:08,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:11:08,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:11:08,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-02-06 04:11:08,793 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:11:08,795 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:11:08,795 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:11:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971812679] [2025-02-06 04:11:08,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971812679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:08,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:11:08,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:11:08,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053050846] [2025-02-06 04:11:08,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:08,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:11:08,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:11:08,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:11:08,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:11:08,797 INFO L87 Difference]: Start difference. First operand 105 states and 145 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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:11:10,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:10,833 INFO L93 Difference]: Finished difference Result 208 states and 288 transitions. [2025-02-06 04:11:10,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:11:10,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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 129 [2025-02-06 04:11:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:10,834 INFO L225 Difference]: With dead ends: 208 [2025-02-06 04:11:10,835 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 04:11:10,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:11:10,836 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 134 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:11:10,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 395 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-06 04:11:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 04:11:10,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-06 04:11:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 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:11:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2025-02-06 04:11:10,846 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 129 [2025-02-06 04:11:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:10,846 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2025-02-06 04:11:10,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 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:11:10,846 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2025-02-06 04:11:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 04:11:10,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:10,849 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] [2025-02-06 04:11:10,864 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 (4)] Ended with exit code 0 [2025-02-06 04:11:11,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:11:11,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:11,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:11,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1234463742, now seen corresponding path program 1 times [2025-02-06 04:11:11,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:11:11,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127973531] [2025-02-06 04:11:11,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:11,054 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:11:11,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:11:11,056 INFO L229 MonitoredProcess]: Starting monitored process 5 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:11:11,059 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 (5)] Waiting until timeout for monitored process [2025-02-06 04:11:11,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 04:11:11,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 04:11:11,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:11,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:11,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:11:11,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:11:11,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-02-06 04:11:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 04:11:11,648 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:11:11,649 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:11:11,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127973531] [2025-02-06 04:11:11,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127973531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:11,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:11:11,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:11:11,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174054010] [2025-02-06 04:11:11,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:11,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:11:11,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:11:11,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:11:11,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:11:11,652 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 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:11:13,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:13,438 INFO L93 Difference]: Finished difference Result 208 states and 286 transitions. [2025-02-06 04:11:13,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:11:13,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 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 131 [2025-02-06 04:11:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:13,440 INFO L225 Difference]: With dead ends: 208 [2025-02-06 04:11:13,440 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 04:11:13,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:11:13,441 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 122 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 04:11:13,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 390 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 04:11:13,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 04:11:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-06 04:11:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 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:11:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 143 transitions. [2025-02-06 04:11:13,453 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 143 transitions. Word has length 131 [2025-02-06 04:11:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:13,453 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 143 transitions. [2025-02-06 04:11:13,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 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:11:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 143 transitions. [2025-02-06 04:11:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 04:11:13,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:13,456 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:11:13,472 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 (5)] Ended with exit code 0 [2025-02-06 04:11:13,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:11:13,656 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:13,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:13,657 INFO L85 PathProgramCache]: Analyzing trace with hash 58814300, now seen corresponding path program 1 times [2025-02-06 04:11:13,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:11:13,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128346426] [2025-02-06 04:11:13,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:13,658 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:11:13,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:11:13,660 INFO L229 MonitoredProcess]: Starting monitored process 6 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:11:13,662 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 (6)] Waiting until timeout for monitored process [2025-02-06 04:11:13,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 04:11:14,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 04:11:14,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:14,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:14,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:11:14,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:11:14,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-02-06 04:11:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-02-06 04:11:14,203 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:11:14,203 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:11:14,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128346426] [2025-02-06 04:11:14,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128346426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:14,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:11:14,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:11:14,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029677205] [2025-02-06 04:11:14,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:14,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:11:14,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:11:14,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:11:14,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:11:14,204 INFO L87 Difference]: Start difference. First operand 105 states and 143 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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:11:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:15,974 INFO L93 Difference]: Finished difference Result 208 states and 284 transitions. [2025-02-06 04:11:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:11:15,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 133 [2025-02-06 04:11:15,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:15,976 INFO L225 Difference]: With dead ends: 208 [2025-02-06 04:11:15,976 INFO L226 Difference]: Without dead ends: 106 [2025-02-06 04:11:15,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:11:15,977 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 113 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-06 04:11:15,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 386 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-06 04:11:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-06 04:11:15,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-06 04:11:15,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.264367816091954) internal successors, (110), 87 states have internal predecessors, (110), 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:11:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 142 transitions. [2025-02-06 04:11:15,989 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 142 transitions. Word has length 133 [2025-02-06 04:11:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:15,990 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 142 transitions. [2025-02-06 04:11:15,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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:11:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 142 transitions. [2025-02-06 04:11:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-06 04:11:15,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:15,991 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:11:16,005 INFO L540 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 (6)] Forceful destruction successful, exit code 0 [2025-02-06 04:11:16,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:11:16,192 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:16,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:16,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1948039554, now seen corresponding path program 1 times [2025-02-06 04:11:16,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:11:16,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036084327] [2025-02-06 04:11:16,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:16,193 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:11:16,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:11:16,195 INFO L229 MonitoredProcess]: Starting monitored process 7 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:11:16,196 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 (7)] Waiting until timeout for monitored process [2025-02-06 04:11:16,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 04:11:16,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 04:11:16,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:16,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:16,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 04:11:16,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:11:16,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:16,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 57 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2025-02-06 04:11:17,395 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 0 case distinctions, treesize of input 63 treesize of output 31 [2025-02-06 04:11:19,071 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 8 treesize of output 1 [2025-02-06 04:11:19,798 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 20 treesize of output 19 [2025-02-06 04:11:20,514 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 31 treesize of output 22 [2025-02-06 04:11:21,047 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 31 treesize of output 22 [2025-02-06 04:11:21,571 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 31 treesize of output 22 [2025-02-06 04:11:22,287 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 28 treesize of output 30 [2025-02-06 04:11:22,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2025-02-06 04:11:22,880 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:11:22,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 93 [2025-02-06 04:11:23,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:11:23,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 28 [2025-02-06 04:11:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 139 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-02-06 04:11:23,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:11:24,242 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:11:24,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036084327] [2025-02-06 04:11:24,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036084327] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:11:24,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2114685631] [2025-02-06 04:11:24,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:24,243 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 04:11:24,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 04:11:24,245 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 04:11:24,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-02-06 04:11:24,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-06 04:11:25,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-06 04:11:25,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:25,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:25,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 04:11:25,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:11:28,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2025-02-06 04:11:28,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2025-02-06 04:11:28,533 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-06 04:11:28,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2025-02-06 04:11:28,776 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 24 treesize of output 12 [2025-02-06 04:11:28,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2025-02-06 04:11:28,924 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:11:28,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:11:28,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2114685631] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:11:28,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:11:28,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2025-02-06 04:11:28,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11329371] [2025-02-06 04:11:28,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:11:28,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:11:28,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:11:28,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:11:28,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-02-06 04:11:28,926 INFO L87 Difference]: Start difference. First operand 105 states and 142 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 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:11:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:11:32,987 INFO L93 Difference]: Finished difference Result 246 states and 333 transitions. [2025-02-06 04:11:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:11:32,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 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 135 [2025-02-06 04:11:32,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:11:32,989 INFO L225 Difference]: With dead ends: 246 [2025-02-06 04:11:32,989 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 04:11:32,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-02-06 04:11:32,992 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 105 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:11:32,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 314 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-06 04:11:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 04:11:33,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 112. [2025-02-06 04:11:33,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 94 states have internal predecessors, (120), 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:11:33,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 152 transitions. [2025-02-06 04:11:33,004 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 152 transitions. Word has length 135 [2025-02-06 04:11:33,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:11:33,008 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 152 transitions. [2025-02-06 04:11:33,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 6 states have internal predecessors, (58), 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:11:33,009 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 152 transitions. [2025-02-06 04:11:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 04:11:33,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:11:33,010 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:11:33,026 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 (7)] Ended with exit code 0 [2025-02-06 04:11:33,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-02-06 04:11:33,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 04:11:33,411 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:11:33,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:11:33,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1225351995, now seen corresponding path program 1 times [2025-02-06 04:11:33,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:11:33,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525019178] [2025-02-06 04:11:33,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:33,412 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:11:33,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:11:33,414 INFO L229 MonitoredProcess]: Starting monitored process 9 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:11:33,425 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 (9)] Waiting until timeout for monitored process [2025-02-06 04:11:33,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 04:11:34,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 04:11:34,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:34,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:34,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 04:11:34,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:11:34,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,172 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:11:34,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:34,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 57 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 63 [2025-02-06 04:11:34,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 35 [2025-02-06 04:11:35,791 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:11:36,388 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 20 treesize of output 19 [2025-02-06 04:11:36,994 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 28 treesize of output 30 [2025-02-06 04:11:37,729 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 36 treesize of output 41 [2025-02-06 04:11:38,571 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 47 treesize of output 44 [2025-02-06 04:11:39,625 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 47 treesize of output 44 [2025-02-06 04:11:40,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 63 [2025-02-06 04:11:40,313 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:11:40,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 107 [2025-02-06 04:11:40,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 45 treesize of output 51 [2025-02-06 04:11:40,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2025-02-06 04:11:40,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:11:40,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 93 [2025-02-06 04:11:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 261 proven. 139 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-02-06 04:11:40,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:11:50,533 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:11:50,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525019178] [2025-02-06 04:11:50,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525019178] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:11:50,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1092873593] [2025-02-06 04:11:50,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:11:50,533 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 04:11:50,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 04:11:50,535 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 04:11:50,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-02-06 04:11:50,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-06 04:11:52,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-06 04:11:52,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:11:52,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:11:52,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 04:11:52,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:11:52,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:52,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:52,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:52,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:52,893 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 04:11:52,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:52,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:52,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:52,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:52,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:52,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:52,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:52,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:52,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:52,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:52,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:52,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:53,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:53,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:53,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:53,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:53,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:53,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:53,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:53,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:53,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:53,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:53,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:11:53,087 INFO L224 Elim1Store]: Index analysis took 232 ms [2025-02-06 04:11:53,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 64 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 71