./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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-51.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 8054d6a3a26e83c77ffba7f636a5f1933697f2f3ef71fb61f95de16cb4193c3a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:11:25,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:11:25,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:11:25,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:11:25,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:11:25,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:11:25,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:11:25,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:11:25,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:11:25,848 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:11:25,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:11:25,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:11:25,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:11:25,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:11:25,848 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:11:25,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:11:25,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:11:25,849 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:11:25,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:11:25,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:11:25,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:11:25,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:11:25,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:11:25,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:11:25,849 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:11:25,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:11:25,850 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:11:25,850 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:11:25,850 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:11:25,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:11:25,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:11:25,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:11:25,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:11:25,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:11:25,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:11:25,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:11:25,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:11:25,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:11:25,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:11:25,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:11:25,851 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:11:25,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:11:25,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:11:25,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:11:25,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:11:25,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:11:25,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:11:25,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:11:25,851 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 -> 8054d6a3a26e83c77ffba7f636a5f1933697f2f3ef71fb61f95de16cb4193c3a [2025-01-09 16:11:26,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:11:26,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:11:26,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:11:26,097 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:11:26,097 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:11:26,099 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-51.i [2025-01-09 16:11:27,381 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/890607857/e932dcbb5621465b8ffb4125bbd5f0a9/FLAG14d269984 [2025-01-09 16:11:27,610 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:11:27,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-51.i [2025-01-09 16:11:27,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/890607857/e932dcbb5621465b8ffb4125bbd5f0a9/FLAG14d269984 [2025-01-09 16:11:27,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/890607857/e932dcbb5621465b8ffb4125bbd5f0a9 [2025-01-09 16:11:27,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:11:27,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:11:27,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:11:27,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:11:27,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:11:27,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:11:27" (1/1) ... [2025-01-09 16:11:27,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd63900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27, skipping insertion in model container [2025-01-09 16:11:27,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:11:27" (1/1) ... [2025-01-09 16:11:27,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:11:27,796 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-51.i[917,930] [2025-01-09 16:11:27,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:11:27,861 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:11:27,869 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-51.i[917,930] [2025-01-09 16:11:27,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:11:27,923 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:11:27,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27 WrapperNode [2025-01-09 16:11:27,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:11:27,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:11:27,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:11:27,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:11:27,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27" (1/1) ... [2025-01-09 16:11:27,940 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27" (1/1) ... [2025-01-09 16:11:27,981 INFO L138 Inliner]: procedures = 30, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 561 [2025-01-09 16:11:27,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:11:27,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:11:27,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:11:27,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:11:27,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27" (1/1) ... [2025-01-09 16:11:27,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27" (1/1) ... [2025-01-09 16:11:27,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27" (1/1) ... [2025-01-09 16:11:28,002 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:11:28,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27" (1/1) ... [2025-01-09 16:11:28,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27" (1/1) ... [2025-01-09 16:11:28,017 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27" (1/1) ... [2025-01-09 16:11:28,022 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27" (1/1) ... [2025-01-09 16:11:28,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27" (1/1) ... [2025-01-09 16:11:28,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27" (1/1) ... [2025-01-09 16:11:28,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27" (1/1) ... [2025-01-09 16:11:28,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:11:28,037 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:11:28,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:11:28,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:11:28,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27" (1/1) ... [2025-01-09 16:11:28,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:11:28,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:11:28,062 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-01-09 16:11:28,064 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-01-09 16:11:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:11:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:11:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:11:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:11:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:11:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:11:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:11:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:11:28,079 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:11:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:11:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:11:28,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:11:28,189 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:11:28,190 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:11:28,696 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-01-09 16:11:28,697 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:11:28,704 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:11:28,704 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:11:28,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:11:28 BoogieIcfgContainer [2025-01-09 16:11:28,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:11:28,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:11:28,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:11:28,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:11:28,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:11:27" (1/3) ... [2025-01-09 16:11:28,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af991e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:11:28, skipping insertion in model container [2025-01-09 16:11:28,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:27" (2/3) ... [2025-01-09 16:11:28,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af991e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:11:28, skipping insertion in model container [2025-01-09 16:11:28,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:11:28" (3/3) ... [2025-01-09 16:11:28,715 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-51.i [2025-01-09 16:11:28,731 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:11:28,732 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-51.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:11:28,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:11:28,785 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;@71c5166f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:11:28,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:11:28,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:11:28,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 16:11:28,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:11:28,801 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 16:11:28,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:11:28,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:11:28,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2080768941, now seen corresponding path program 1 times [2025-01-09 16:11:28,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:11:28,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300459928] [2025-01-09 16:11:28,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:11:28,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:11:28,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 16:11:28,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 16:11:28,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:11:28,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:11:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 16:11:29,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:11:29,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300459928] [2025-01-09 16:11:29,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300459928] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:11:29,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875965542] [2025-01-09 16:11:29,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:11:29,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:11:29,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:11:29,132 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-01-09 16:11:29,139 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-01-09 16:11:29,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 16:11:29,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 16:11:29,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:11:29,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:11:29,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:11:29,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:11:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 16:11:29,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:11:29,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875965542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:11:29,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:11:29,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:11:29,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010502455] [2025-01-09 16:11:29,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:11:29,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:11:29,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:11:29,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:11:29,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:11:29,421 INFO L87 Difference]: Start difference. First operand has 123 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:11:29,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:11:29,442 INFO L93 Difference]: Finished difference Result 240 states and 376 transitions. [2025-01-09 16:11:29,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:11:29,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-01-09 16:11:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:11:29,448 INFO L225 Difference]: With dead ends: 240 [2025-01-09 16:11:29,449 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 16:11:29,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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-01-09 16:11:29,453 INFO L435 NwaCegarLoop]: 176 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, 176 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-01-09 16:11:29,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:11:29,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 16:11:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 16:11:29,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:11:29,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-01-09 16:11:29,481 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 149 [2025-01-09 16:11:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:11:29,481 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-01-09 16:11:29,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:11:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-01-09 16:11:29,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 16:11:29,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:11:29,484 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 16:11:29,492 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-01-09 16:11:29,685 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-01-09 16:11:29,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:11:29,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:11:29,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1993699407, now seen corresponding path program 1 times [2025-01-09 16:11:29,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:11:29,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251223753] [2025-01-09 16:11:29,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:11:29,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:11:29,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 16:11:29,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 16:11:29,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:11:29,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:11:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:11:30,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:11:30,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251223753] [2025-01-09 16:11:30,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251223753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:11:30,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:11:30,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:11:30,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803108798] [2025-01-09 16:11:30,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:11:30,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:11:30,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:11:30,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:11:30,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:11:30,768 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:11:31,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:11:31,056 INFO L93 Difference]: Finished difference Result 237 states and 349 transitions. [2025-01-09 16:11:31,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:11:31,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 149 [2025-01-09 16:11:31,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:11:31,060 INFO L225 Difference]: With dead ends: 237 [2025-01-09 16:11:31,060 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 16:11:31,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:11:31,062 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 124 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:11:31,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 327 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:11:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 16:11:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 16:11:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:11:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 175 transitions. [2025-01-09 16:11:31,082 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 175 transitions. Word has length 149 [2025-01-09 16:11:31,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:11:31,083 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 175 transitions. [2025-01-09 16:11:31,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 16:11:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 175 transitions. [2025-01-09 16:11:31,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 16:11:31,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:11:31,088 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 16:11:31,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:11:31,088 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:11:31,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:11:31,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2046094208, now seen corresponding path program 1 times [2025-01-09 16:11:31,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:11:31,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466743981] [2025-01-09 16:11:31,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:11:31,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:11:31,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 16:11:31,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 16:11:31,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:11:31,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:11:31,248 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:11:31,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 16:11:31,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 16:11:31,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:11:31,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:11:31,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:11:31,404 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:11:31,405 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:11:31,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:11:31,409 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 16:11:31,554 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:11:31,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:11:31 BoogieIcfgContainer [2025-01-09 16:11:31,559 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:11:31,560 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:11:31,560 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:11:31,560 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:11:31,561 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:11:28" (3/4) ... [2025-01-09 16:11:31,564 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:11:31,568 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:11:31,569 INFO L158 Benchmark]: Toolchain (without parser) took 3916.62ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 112.3MB in the beginning and 156.4MB in the end (delta: -44.1MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2025-01-09 16:11:31,569 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:11:31,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.32ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 96.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:11:31,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.50ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 92.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:11:31,570 INFO L158 Benchmark]: Boogie Preprocessor took 54.89ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 89.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:11:31,570 INFO L158 Benchmark]: RCFGBuilder took 668.03ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 53.8MB in the end (delta: 35.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 16:11:31,570 INFO L158 Benchmark]: TraceAbstraction took 2853.00ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 52.9MB in the beginning and 156.4MB in the end (delta: -103.5MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2025-01-09 16:11:31,570 INFO L158 Benchmark]: Witness Printer took 8.61ms. Allocated memory is still 209.7MB. Free memory was 156.4MB in the beginning and 156.4MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:11:31,572 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.16ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.32ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 96.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.50ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 92.6MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.89ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 89.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 668.03ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 53.8MB in the end (delta: 35.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2853.00ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 52.9MB in the beginning and 156.4MB in the end (delta: -103.5MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. * Witness Printer took 8.61ms. Allocated memory is still 209.7MB. Free memory was 156.4MB in the beginning and 156.4MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 112. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L55] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] signed short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L58] double* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L59] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L60] double* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L61] double* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L62] unsigned long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L63] unsigned long int* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L64] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L65] unsigned long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L66] unsigned long int* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L67] unsigned long int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L68] unsigned long int* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L69] unsigned long int last_1_WrapperStruct00_var_1_17 = 8; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=0, last_1_WrapperStruct00_var_1_17=8] [L139] isInitial = 1 [L140] FCALL initially() [L142] CALL updateLastVariables() [L132] EXPR WrapperStruct00.var_1_17 [L132] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L142] RET updateLastVariables() [L143] CALL updateVariables() [L100] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L102] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L103] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L104] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -32768) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -32768) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L105] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L106] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L107] WrapperStruct00.var_1_6 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_6 [L108] EXPR WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_6 [L108] EXPR WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L108] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L109] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_7 [L110] EXPR WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_7 [L110] EXPR WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L110] EXPR (WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L111] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L112] EXPR WrapperStruct00.var_1_8 [L112] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L112] EXPR WrapperStruct00.var_1_8 [L112] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L112] EXPR (WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L112] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L112] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L113] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L114] EXPR WrapperStruct00.var_1_9 [L114] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_9 [L114] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L114] EXPR (WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L115] WrapperStruct00.var_1_11 = __VERIFIER_nondet_ulong() [L116] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L117] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L118] WrapperStruct00.var_1_12 = __VERIFIER_nondet_ulong() [L119] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L120] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L121] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L122] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L123] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L124] WrapperStruct00.var_1_15 = __VERIFIER_nondet_ulong() [L125] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L126] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L127] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ulong() [L128] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L129] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L143] RET updateVariables() [L144] CALL step() [L73] unsigned long int stepLocal_1 = - last_1_WrapperStruct00_var_1_17; [L74] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8, stepLocal_1=-8] [L74] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_12_Pointer))) [L74] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L74] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_12_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8, stepLocal_1=-8] [L74] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8, stepLocal_1=-8] [L74] COND FALSE !(((((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_12_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer))) != stepLocal_1) [L77] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L77] (*(WrapperStruct00_var_1_10_Pointer)) = (*(WrapperStruct00_var_1_15_Pointer)) [L79] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L79] COND TRUE (*(WrapperStruct00_var_1_10_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer)) [L80] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L80] (*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_10_Pointer)) == (((((*(WrapperStruct00_var_1_16_Pointer))) > ((*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer))) : ((*(WrapperStruct00_var_1_12_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L80] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_10_Pointer)) == (((((*(WrapperStruct00_var_1_16_Pointer))) > ((*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer))) : ((*(WrapperStruct00_var_1_12_Pointer))))))) [L88] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L88] unsigned long int stepLocal_0 = (*(WrapperStruct00_var_1_10_Pointer)); [L89] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8, stepLocal_0=-4294967298] [L89] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L96] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L96] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L144] RET step() [L145] CALL, EXPR property() [L135] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L135] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= ((*(WrapperStruct00_var_1_10_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_7_Pointer)) + (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_9_Pointer)) + 63.25))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_9_Pointer)) + 63.25)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_8_Pointer)))) [L135] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L135] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L135] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= ((*(WrapperStruct00_var_1_10_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_7_Pointer)) + (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_9_Pointer)) + 63.25))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_9_Pointer)) + 63.25)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L135] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= ((*(WrapperStruct00_var_1_10_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_7_Pointer)) + (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_9_Pointer)) + 63.25))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_9_Pointer)) + 63.25)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_8_Pointer))))) && ((((((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_12_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer))) != (- last_1_WrapperStruct00_var_1_17)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L135] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= ((*(WrapperStruct00_var_1_10_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_7_Pointer)) + (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_9_Pointer)) + 63.25))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_9_Pointer)) + 63.25)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_8_Pointer))))) && ((((((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_12_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer))) != (- last_1_WrapperStruct00_var_1_17)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_15_Pointer)))))) && (((*(WrapperStruct00_var_1_10_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_10_Pointer)) == (((((*(WrapperStruct00_var_1_16_Pointer))) > ((*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer))) : ((*(WrapperStruct00_var_1_12_Pointer))))))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_16_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L135-L136] return (((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= ((*(WrapperStruct00_var_1_10_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_7_Pointer)) + (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_9_Pointer)) + 63.25))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_9_Pointer)) + 63.25)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_8_Pointer))))) && ((((((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_12_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer))) != (- last_1_WrapperStruct00_var_1_17)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) ((((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_16_Pointer))))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_15_Pointer)))))) && (((*(WrapperStruct00_var_1_10_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && ((*(WrapperStruct00_var_1_10_Pointer)) == (((((*(WrapperStruct00_var_1_16_Pointer))) > ((*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_16_Pointer))) : ((*(WrapperStruct00_var_1_12_Pointer))))))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_16_Pointer))))) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:43}, WrapperStruct00_var_1_11_Pointer={4:47}, WrapperStruct00_var_1_12_Pointer={4:51}, WrapperStruct00_var_1_13_Pointer={4:55}, WrapperStruct00_var_1_15_Pointer={4:59}, WrapperStruct00_var_1_16_Pointer={4:63}, WrapperStruct00_var_1_17_Pointer={4:67}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:11}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:27}, WrapperStruct00_var_1_9_Pointer={4:35}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 125 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 124 mSDsluCounter, 503 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 194 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 195 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 309 mSDtfsCounter, 195 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 598 NumberOfCodeBlocks, 598 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 444 ConstructedInterpolants, 0 QuantifiedInterpolants, 855 SizeOfPredicates, 0 NumberOfNonLiveVariables, 577 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2016/2052 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-01-09 16:11:31,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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-51.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 8054d6a3a26e83c77ffba7f636a5f1933697f2f3ef71fb61f95de16cb4193c3a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:11:33,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:11:33,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 16:11:33,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:11:33,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:11:33,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:11:33,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:11:33,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:11:33,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:11:33,697 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:11:33,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:11:33,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:11:33,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:11:33,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:11:33,699 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:11:33,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:11:33,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:11:33,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:11:33,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:11:33,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:11:33,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:11:33,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:11:33,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:11:33,700 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:11:33,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:11:33,700 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:11:33,700 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:11:33,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:11:33,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:11:33,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:11:33,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:11:33,700 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 -> 8054d6a3a26e83c77ffba7f636a5f1933697f2f3ef71fb61f95de16cb4193c3a [2025-01-09 16:11:33,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:11:33,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:11:33,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:11:33,999 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:11:34,000 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:11:34,000 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-51.i [2025-01-09 16:11:35,152 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/203d951b7/dc084387ce9a4d5e93943b9611efaf97/FLAGc1c9763e4 [2025-01-09 16:11:35,387 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:11:35,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-51.i [2025-01-09 16:11:35,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/203d951b7/dc084387ce9a4d5e93943b9611efaf97/FLAGc1c9763e4 [2025-01-09 16:11:35,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/203d951b7/dc084387ce9a4d5e93943b9611efaf97 [2025-01-09 16:11:35,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:11:35,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:11:35,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:11:35,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:11:35,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:11:35,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:11:35" (1/1) ... [2025-01-09 16:11:35,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d4b9f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35, skipping insertion in model container [2025-01-09 16:11:35,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:11:35" (1/1) ... [2025-01-09 16:11:35,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:11:35,854 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-51.i[917,930] [2025-01-09 16:11:35,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:11:35,912 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:11:35,919 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-51.i[917,930] [2025-01-09 16:11:35,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:11:35,971 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:11:35,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35 WrapperNode [2025-01-09 16:11:35,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:11:35,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:11:35,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:11:35,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:11:35,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35" (1/1) ... [2025-01-09 16:11:35,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35" (1/1) ... [2025-01-09 16:11:36,039 INFO L138 Inliner]: procedures = 37, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 559 [2025-01-09 16:11:36,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:11:36,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:11:36,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:11:36,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:11:36,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35" (1/1) ... [2025-01-09 16:11:36,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35" (1/1) ... [2025-01-09 16:11:36,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35" (1/1) ... [2025-01-09 16:11:36,076 INFO L175 MemorySlicer]: Split 146 memory accesses to 2 slices as follows [2, 144]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-01-09 16:11:36,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35" (1/1) ... [2025-01-09 16:11:36,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35" (1/1) ... [2025-01-09 16:11:36,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35" (1/1) ... [2025-01-09 16:11:36,099 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35" (1/1) ... [2025-01-09 16:11:36,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35" (1/1) ... [2025-01-09 16:11:36,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35" (1/1) ... [2025-01-09 16:11:36,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35" (1/1) ... [2025-01-09 16:11:36,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:11:36,116 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:11:36,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:11:36,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:11:36,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35" (1/1) ... [2025-01-09 16:11:36,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:11:36,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:11:36,143 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-01-09 16:11:36,148 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-01-09 16:11:36,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:11:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 16:11:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 16:11:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-01-09 16:11:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-01-09 16:11:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 16:11:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 16:11:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:11:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:11:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:11:36,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:11:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 16:11:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 16:11:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 16:11:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 16:11:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 16:11:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 16:11:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 16:11:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 16:11:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 16:11:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 16:11:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:11:36,167 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:11:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:11:36,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:11:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:11:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:11:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 16:11:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 16:11:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 16:11:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 16:11:36,272 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:11:36,274 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:11:40,096 INFO L? ?]: Removed 151 outVars from TransFormulas that were not future-live. [2025-01-09 16:11:40,096 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:11:40,104 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:11:40,105 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:11:40,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:11:40 BoogieIcfgContainer [2025-01-09 16:11:40,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:11:40,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:11:40,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:11:40,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:11:40,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:11:35" (1/3) ... [2025-01-09 16:11:40,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c12811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:11:40, skipping insertion in model container [2025-01-09 16:11:40,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:35" (2/3) ... [2025-01-09 16:11:40,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c12811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:11:40, skipping insertion in model container [2025-01-09 16:11:40,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:11:40" (3/3) ... [2025-01-09 16:11:40,111 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-51.i [2025-01-09 16:11:40,119 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:11:40,120 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-51.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:11:40,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:11:40,158 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;@1fd0b5b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:11:40,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:11:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:11:40,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 16:11:40,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:11:40,171 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 16:11:40,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:11:40,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:11:40,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1817033071, now seen corresponding path program 1 times [2025-01-09 16:11:40,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:11:40,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540368600] [2025-01-09 16:11:40,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:11:40,182 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-01-09 16:11:40,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:11:40,184 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-01-09 16:11:40,186 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-01-09 16:11:40,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 16:11:40,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 16:11:40,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:11:40,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:11:40,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:11:40,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:11:40,500 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-01-09 16:11:40,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:11:40,501 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:11:40,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540368600] [2025-01-09 16:11:40,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540368600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:11:40,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:11:40,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:11:40,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155024677] [2025-01-09 16:11:40,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:11:40,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:11:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:11:40,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:11:40,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:11:40,522 INFO L87 Difference]: Start difference. First operand has 123 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:11:40,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:11:40,555 INFO L93 Difference]: Finished difference Result 240 states and 376 transitions. [2025-01-09 16:11:40,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:11:40,556 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-01-09 16:11:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:11:40,560 INFO L225 Difference]: With dead ends: 240 [2025-01-09 16:11:40,561 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 16:11:40,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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-01-09 16:11:40,564 INFO L435 NwaCegarLoop]: 176 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, 176 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-01-09 16:11:40,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:11:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 16:11:40,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 16:11:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:11:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-01-09 16:11:40,588 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 149 [2025-01-09 16:11:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:11:40,588 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-01-09 16:11:40,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:11:40,589 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-01-09 16:11:40,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 16:11:40,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:11:40,590 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 16:11:40,601 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-01-09 16:11:40,795 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-01-09 16:11:40,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:11:40,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:11:40,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1904102605, now seen corresponding path program 1 times [2025-01-09 16:11:40,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:11:40,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986389169] [2025-01-09 16:11:40,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:11:40,796 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-01-09 16:11:40,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:11:40,800 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-01-09 16:11:40,800 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-01-09 16:11:40,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 16:11:41,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 16:11:41,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:11:41,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:11:41,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:11:41,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:11:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2025-01-09 16:11:41,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:11:41,103 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:11:41,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986389169] [2025-01-09 16:11:41,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986389169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:11:41,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:11:41,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:11:41,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649234075] [2025-01-09 16:11:41,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:11:41,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:11:41,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:11:41,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:11:41,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:11:41,105 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:11:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:11:41,172 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2025-01-09 16:11:41,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:11:41,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-01-09 16:11:41,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:11:41,174 INFO L225 Difference]: With dead ends: 239 [2025-01-09 16:11:41,174 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 16:11:41,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 146 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-01-09 16:11:41,175 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:11:41,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:11:41,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 16:11:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 16:11:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:11:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2025-01-09 16:11:41,183 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 149 [2025-01-09 16:11:41,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:11:41,184 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2025-01-09 16:11:41,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:11:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2025-01-09 16:11:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 16:11:41,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:11:41,185 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 16:11:41,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 16:11:41,390 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-01-09 16:11:41,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:11:41,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:11:41,391 INFO L85 PathProgramCache]: Analyzing trace with hash 388978421, now seen corresponding path program 1 times [2025-01-09 16:11:41,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:11:41,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637997053] [2025-01-09 16:11:41,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:11:41,392 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-01-09 16:11:41,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:11:41,393 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-01-09 16:11:41,395 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-01-09 16:11:41,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 16:11:41,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 16:11:41,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:11:41,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:11:41,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:11:41,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:11:41,761 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 15 treesize of output 7 [2025-01-09 16:11:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:11:41,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:11:41,770 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:11:41,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637997053] [2025-01-09 16:11:41,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637997053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:11:41,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:11:41,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:11:41,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376930236] [2025-01-09 16:11:41,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:11:41,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:11:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:11:41,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:11:41,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:11:41,771 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:11:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:11:41,788 INFO L93 Difference]: Finished difference Result 241 states and 353 transitions. [2025-01-09 16:11:41,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:11:41,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-01-09 16:11:41,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:11:41,789 INFO L225 Difference]: With dead ends: 241 [2025-01-09 16:11:41,789 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 16:11:41,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:11:41,790 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 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-01-09 16:11:41,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:11:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 16:11:41,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 16:11:41,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 101 states have internal predecessors, (139), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 16:11:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 177 transitions. [2025-01-09 16:11:41,797 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 177 transitions. Word has length 149 [2025-01-09 16:11:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:11:41,797 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 177 transitions. [2025-01-09 16:11:41,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:11:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 177 transitions. [2025-01-09 16:11:41,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 16:11:41,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:11:41,799 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 16:11:41,808 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-01-09 16:11:41,999 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-01-09 16:11:42,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:11:42,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:11:42,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2005265062, now seen corresponding path program 1 times [2025-01-09 16:11:42,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:11:42,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784834126] [2025-01-09 16:11:42,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:11:42,001 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-01-09 16:11:42,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:11:42,005 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-01-09 16:11:42,009 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-01-09 16:11:42,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 16:11:42,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 16:11:42,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:11:42,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:11:42,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 16:11:42,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:11:44,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2025-01-09 16:11:44,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 55 [2025-01-09 16:11:45,011 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 104 treesize of output 55 [2025-01-09 16:11:45,425 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 104 treesize of output 55 [2025-01-09 16:11:45,825 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 104 treesize of output 55 [2025-01-09 16:11:46,295 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 104 treesize of output 55 [2025-01-09 16:11:46,814 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 104 treesize of output 55 [2025-01-09 16:11:47,342 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2025-01-09 16:11:47,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 69 [2025-01-09 16:11:47,652 INFO L349 Elim1Store]: treesize reduction 78, result has 22.0 percent of original size [2025-01-09 16:11:47,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 124 [2025-01-09 16:11:47,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:11:47,834 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 310 treesize of output 134 [2025-01-09 16:11:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-01-09 16:11:47,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:11:51,792 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:11:51,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784834126] [2025-01-09 16:11:51,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784834126] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:11:51,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1536354787] [2025-01-09 16:11:51,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:11:51,793 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 16:11:51,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 16:11:51,795 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 16:11:51,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-01-09 16:11:51,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 16:11:53,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 16:11:53,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:11:53,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:11:53,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 16:11:53,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:11:55,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2025-01-09 16:11:56,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 59 [2025-01-09 16:11:56,651 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 112 treesize of output 59 [2025-01-09 16:11:57,246 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 112 treesize of output 59 [2025-01-09 16:11:57,785 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 112 treesize of output 59 [2025-01-09 16:11:58,303 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 112 treesize of output 59 [2025-01-09 16:11:58,897 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 112 treesize of output 59 [2025-01-09 16:11:59,592 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2025-01-09 16:11:59,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 73 [2025-01-09 16:11:59,950 INFO L349 Elim1Store]: treesize reduction 78, result has 22.0 percent of original size [2025-01-09 16:11:59,951 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 4 case distinctions, treesize of input 169 treesize of output 128 [2025-01-09 16:12:00,192 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 0 case distinctions, treesize of input 318 treesize of output 138 [2025-01-09 16:12:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-01-09 16:12:00,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:12:01,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1536354787] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:12:01,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:12:01,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2025-01-09 16:12:01,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431532919] [2025-01-09 16:12:01,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:12:01,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 16:12:01,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:12:01,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 16:12:01,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-01-09 16:12:01,023 INFO L87 Difference]: Start difference. First operand 122 states and 177 transitions. Second operand has 20 states, 20 states have (on average 6.1) internal successors, (122), 19 states have internal predecessors, (122), 6 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2025-01-09 16:12:02,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:12:03,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:12:05,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:12:07,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:12:09,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:12:10,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:12:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:12:21,572 INFO L93 Difference]: Finished difference Result 424 states and 614 transitions. [2025-01-09 16:12:21,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:12:21,576 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.1) internal successors, (122), 19 states have internal predecessors, (122), 6 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) Word has length 151 [2025-01-09 16:12:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:12:21,578 INFO L225 Difference]: With dead ends: 424 [2025-01-09 16:12:21,578 INFO L226 Difference]: Without dead ends: 305 [2025-01-09 16:12:21,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 319 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=189, Invalid=741, Unknown=0, NotChecked=0, Total=930 [2025-01-09 16:12:21,582 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 503 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:12:21,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 949 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 19.9s Time] [2025-01-09 16:12:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-01-09 16:12:21,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 299. [2025-01-09 16:12:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 250 states have (on average 1.38) internal successors, (345), 252 states have internal predecessors, (345), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 16:12:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 435 transitions. [2025-01-09 16:12:21,631 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 435 transitions. Word has length 151 [2025-01-09 16:12:21,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:12:21,631 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 435 transitions. [2025-01-09 16:12:21,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.1) internal successors, (122), 19 states have internal predecessors, (122), 6 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2025-01-09 16:12:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 435 transitions. [2025-01-09 16:12:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 16:12:21,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:12:21,633 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 16:12:21,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-01-09 16:12:21,845 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-01-09 16:12:22,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-01-09 16:12:22,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:12:22,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:12:22,035 INFO L85 PathProgramCache]: Analyzing trace with hash 98861796, now seen corresponding path program 1 times [2025-01-09 16:12:22,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:12:22,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014098068] [2025-01-09 16:12:22,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:12:22,035 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-01-09 16:12:22,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:12:22,038 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-01-09 16:12:22,039 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-01-09 16:12:22,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 16:12:22,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 16:12:22,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:12:22,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:12:22,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:12:22,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:12:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-01-09 16:12:22,281 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:12:22,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:12:22,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014098068] [2025-01-09 16:12:22,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014098068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:12:22,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:12:22,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:12:22,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314462445] [2025-01-09 16:12:22,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:12:22,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:12:22,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:12:22,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:12:22,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:12:22,283 INFO L87 Difference]: Start difference. First operand 299 states and 435 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:12:22,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:12:22,351 INFO L93 Difference]: Finished difference Result 595 states and 867 transitions. [2025-01-09 16:12:22,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:12:22,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2025-01-09 16:12:22,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:12:22,355 INFO L225 Difference]: With dead ends: 595 [2025-01-09 16:12:22,355 INFO L226 Difference]: Without dead ends: 299 [2025-01-09 16:12:22,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 148 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-01-09 16:12:22,356 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:12:22,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:12:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-01-09 16:12:22,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2025-01-09 16:12:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 250 states have (on average 1.376) internal successors, (344), 252 states have internal predecessors, (344), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 16:12:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 434 transitions. [2025-01-09 16:12:22,375 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 434 transitions. Word has length 151 [2025-01-09 16:12:22,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:12:22,375 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 434 transitions. [2025-01-09 16:12:22,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 16:12:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 434 transitions. [2025-01-09 16:12:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 16:12:22,377 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:12:22,377 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 16:12:22,386 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-01-09 16:12:22,581 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 [2025-01-09 16:12:22,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:12:22,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:12:22,582 INFO L85 PathProgramCache]: Analyzing trace with hash -38482489, now seen corresponding path program 1 times [2025-01-09 16:12:22,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:12:22,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175905778] [2025-01-09 16:12:22,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:12:22,582 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-01-09 16:12:22,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:12:22,584 INFO L229 MonitoredProcess]: Starting monitored process 8 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-01-09 16:12:22,586 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 (8)] Waiting until timeout for monitored process [2025-01-09 16:12:22,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 16:12:22,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 16:12:22,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:12:22,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:12:22,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 16:12:22,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:12:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 16:12:22,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:12:22,836 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:12:22,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175905778] [2025-01-09 16:12:22,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175905778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:12:22,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:12:22,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:12:22,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299226224] [2025-01-09 16:12:22,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:12:22,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:12:22,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:12:22,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:12:22,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:12:22,837 INFO L87 Difference]: Start difference. First operand 299 states and 434 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:12:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:12:22,887 INFO L93 Difference]: Finished difference Result 597 states and 869 transitions. [2025-01-09 16:12:22,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:12:22,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 16:12:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:12:22,890 INFO L225 Difference]: With dead ends: 597 [2025-01-09 16:12:22,890 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 16:12:22,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:12:22,891 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:12:22,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:12:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 16:12:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2025-01-09 16:12:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 252 states have (on average 1.373015873015873) internal successors, (346), 254 states have internal predecessors, (346), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 43 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 16:12:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 436 transitions. [2025-01-09 16:12:22,915 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 436 transitions. Word has length 152 [2025-01-09 16:12:22,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:12:22,916 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 436 transitions. [2025-01-09 16:12:22,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 16:12:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 436 transitions. [2025-01-09 16:12:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 16:12:22,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:12:22,918 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 16:12:22,929 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 (8)] Ended with exit code 0 [2025-01-09 16:12:23,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-01-09 16:12:23,119 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:12:23,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:12:23,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2034872320, now seen corresponding path program 1 times [2025-01-09 16:12:23,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:12:23,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044662760] [2025-01-09 16:12:23,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:12:23,120 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-01-09 16:12:23,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:12:23,122 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-01-09 16:12:23,125 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-01-09 16:12:23,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:12:23,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:12:23,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:12:23,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:12:23,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 16:12:23,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:12:25,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-01-09 16:12:30,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 61 [2025-01-09 16:12:30,607 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 118 treesize of output 61 [2025-01-09 16:12:31,165 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 118 treesize of output 61 [2025-01-09 16:12:31,699 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 118 treesize of output 61 [2025-01-09 16:12:32,221 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 118 treesize of output 61 [2025-01-09 16:12:32,769 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 118 treesize of output 61 [2025-01-09 16:12:33,385 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2025-01-09 16:12:33,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 81 [2025-01-09 16:12:33,723 INFO L349 Elim1Store]: treesize reduction 78, result has 22.0 percent of original size [2025-01-09 16:12:33,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 157 treesize of output 136 [2025-01-09 16:12:33,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:12:33,911 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 297 treesize of output 149 [2025-01-09 16:12:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 9 proven. 443 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-01-09 16:12:33,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:12:36,388 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:12:36,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044662760] [2025-01-09 16:12:36,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044662760] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:12:36,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [243730103] [2025-01-09 16:12:36,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:12:36,389 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 16:12:36,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 16:12:36,391 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-01-09 16:12:36,393 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-01-09 16:12:36,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 16:12:38,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 16:12:38,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:12:38,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:12:38,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 16:12:38,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:12:48,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-01-09 16:12:53,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 69 [2025-01-09 16:12:56,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-01-09 16:12:56,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-01-09 16:12:57,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-01-09 16:12:57,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-01-09 16:12:58,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2025-01-09 16:13:01,679 INFO L349 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2025-01-09 16:13:01,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 48 [2025-01-09 16:13:04,264 INFO L349 Elim1Store]: treesize reduction 90, result has 19.6 percent of original size [2025-01-09 16:13:04,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 103 [2025-01-09 16:13:04,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 106 [2025-01-09 16:13:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 9 proven. 443 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-01-09 16:13:04,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:13:05,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [243730103] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:13:05,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:13:05,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2025-01-09 16:13:05,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35235023] [2025-01-09 16:13:05,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:13:05,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 16:13:05,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:13:05,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 16:13:05,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=895, Unknown=6, NotChecked=0, Total=1056 [2025-01-09 16:13:05,499 INFO L87 Difference]: Start difference. First operand 301 states and 436 transitions. Second operand has 29 states, 27 states have (on average 4.888888888888889) internal successors, (132), 25 states have internal predecessors, (132), 8 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 7 states have call predecessors, (38), 8 states have call successors, (38) [2025-01-09 16:13:07,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]