./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:46:18,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:46:18,686 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:46:18,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:46:18,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:46:18,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:46:18,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:46:18,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:46:18,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:46:18,714 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:46:18,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:46:18,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:46:18,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:46:18,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:46:18,715 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:46:18,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:46:18,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:46:18,715 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:46:18,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:46:18,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:46:18,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:46:18,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:46:18,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:46:18,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:46:18,715 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:46:18,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:46:18,715 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:46:18,715 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:46:18,715 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:46:18,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:46:18,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:46:18,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:46:18,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:46:18,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:46:18,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:46:18,717 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:46:18,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:46:18,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:46:18,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:46:18,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:46:18,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:46:18,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:46:18,717 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:46:18,717 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 [2025-03-04 01:46:18,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:46:18,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:46:18,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:46:18,924 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:46:18,925 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:46:18,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2025-03-04 01:46:19,977 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4614033/8e1e199327444788bc003c4532a32a92/FLAG64d5bc4ca [2025-03-04 01:46:20,198 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:46:20,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2025-03-04 01:46:20,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4614033/8e1e199327444788bc003c4532a32a92/FLAG64d5bc4ca [2025-03-04 01:46:20,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c4614033/8e1e199327444788bc003c4532a32a92 [2025-03-04 01:46:20,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:46:20,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:46:20,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:46:20,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:46:20,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:46:20,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:46:20" (1/1) ... [2025-03-04 01:46:20,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4beb904e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:20, skipping insertion in model container [2025-03-04 01:46:20,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:46:20" (1/1) ... [2025-03-04 01:46:20,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:46:20,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i[916,929] [2025-03-04 01:46:20,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:46:20,701 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:46:20,710 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i[916,929] [2025-03-04 01:46:20,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:46:20,761 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:46:20,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:20 WrapperNode [2025-03-04 01:46:20,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:46:20,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:46:20,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:46:20,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:46:20,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:20" (1/1) ... [2025-03-04 01:46:20,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:20" (1/1) ... [2025-03-04 01:46:20,827 INFO L138 Inliner]: procedures = 29, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 365 [2025-03-04 01:46:20,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:46:20,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:46:20,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:46:20,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:46:20,834 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:20" (1/1) ... [2025-03-04 01:46:20,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:20" (1/1) ... [2025-03-04 01:46:20,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:20" (1/1) ... [2025-03-04 01:46:20,847 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2025-03-04 01:46:20,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:20" (1/1) ... [2025-03-04 01:46:20,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:20" (1/1) ... [2025-03-04 01:46:20,854 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:20" (1/1) ... [2025-03-04 01:46:20,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:20" (1/1) ... [2025-03-04 01:46:20,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:20" (1/1) ... [2025-03-04 01:46:20,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:20" (1/1) ... [2025-03-04 01:46:20,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:46:20,863 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:46:20,863 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:46:20,863 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:46:20,864 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:20" (1/1) ... [2025-03-04 01:46:20,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:46:20,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:46:20,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:46:20,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:46:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:46:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:46:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:46:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:46:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:46:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:46:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:46:20,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:46:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:46:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:46:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:46:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:46:20,907 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:46:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:46:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:46:20,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:46:20,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:46:20,978 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:46:20,979 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:46:21,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc property_#t~mem54#1;havoc property_#t~ite62#1;havoc property_#t~mem57#1;havoc property_#t~mem55#1;havoc property_#t~mem56#1;havoc property_#t~mem61#1;havoc property_#t~mem58#1;havoc property_#t~ite60#1;havoc property_#t~mem59#1;havoc property_#t~mem65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem66#1;havoc property_#t~ite82#1;havoc property_#t~mem67#1;havoc property_#t~ite79#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite76#1;havoc property_#t~mem70#1;havoc property_#t~ite73#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~short83#1;havoc property_#t~ite87#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~short95#1; [2025-03-04 01:46:21,254 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-03-04 01:46:21,255 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:46:21,264 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:46:21,265 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:46:21,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:46:21 BoogieIcfgContainer [2025-03-04 01:46:21,265 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:46:21,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:46:21,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:46:21,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:46:21,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:46:20" (1/3) ... [2025-03-04 01:46:21,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297a897b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:46:21, skipping insertion in model container [2025-03-04 01:46:21,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:20" (2/3) ... [2025-03-04 01:46:21,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297a897b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:46:21, skipping insertion in model container [2025-03-04 01:46:21,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:46:21" (3/3) ... [2025-03-04 01:46:21,273 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-0.i [2025-03-04 01:46:21,282 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:46:21,283 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-0.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:46:21,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:46:21,324 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;@1fcd215d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:46:21,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:46:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 01:46:21,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 01:46:21,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:46:21,334 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:46:21,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:46:21,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:46:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash 405337358, now seen corresponding path program 1 times [2025-03-04 01:46:21,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:46:21,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592133048] [2025-03-04 01:46:21,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:46:21,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:46:21,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 01:46:21,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 01:46:21,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:46:21,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:46:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-04 01:46:21,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:46:21,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592133048] [2025-03-04 01:46:21,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592133048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:46:21,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502561805] [2025-03-04 01:46:21,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:46:21,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:46:21,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:46:21,536 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:46:21,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:46:21,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 01:46:21,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 01:46:21,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:46:21,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:46:21,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:46:21,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:46:21,722 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-04 01:46:21,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:46:21,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502561805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:46:21,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:46:21,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:46:21,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766031464] [2025-03-04 01:46:21,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:46:21,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:46:21,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:46:21,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:46:21,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:46:21,745 INFO L87 Difference]: Start difference. First operand has 84 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:46:21,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:46:21,762 INFO L93 Difference]: Finished difference Result 159 states and 242 transitions. [2025-03-04 01:46:21,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:46:21,763 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2025-03-04 01:46:21,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:46:21,767 INFO L225 Difference]: With dead ends: 159 [2025-03-04 01:46:21,767 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 01:46:21,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:46:21,771 INFO L435 NwaCegarLoop]: 108 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, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:46:21,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:46:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 01:46:21,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-04 01:46:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 01:46:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2025-03-04 01:46:21,793 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 78 [2025-03-04 01:46:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:46:21,794 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2025-03-04 01:46:21,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:46:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2025-03-04 01:46:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 01:46:21,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:46:21,796 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:46:21,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:46:21,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:46:21,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:46:21,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:46:21,997 INFO L85 PathProgramCache]: Analyzing trace with hash 650052084, now seen corresponding path program 1 times [2025-03-04 01:46:21,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:46:21,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25819817] [2025-03-04 01:46:21,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:46:21,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:46:22,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 01:46:22,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 01:46:22,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:46:22,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:46:22,094 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:46:22,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 01:46:22,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 01:46:22,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:46:22,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:46:22,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:46:22,164 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:46:22,165 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:46:22,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:46:22,168 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 01:46:22,251 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:46:22,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:46:22 BoogieIcfgContainer [2025-03-04 01:46:22,254 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:46:22,254 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:46:22,254 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:46:22,254 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:46:22,255 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:46:21" (3/4) ... [2025-03-04 01:46:22,256 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:46:22,256 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:46:22,257 INFO L158 Benchmark]: Toolchain (without parser) took 1715.30ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 58.3MB in the end (delta: 47.8MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2025-03-04 01:46:22,257 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:46:22,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.08ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 93.2MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:46:22,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.75ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 89.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:46:22,257 INFO L158 Benchmark]: Boogie Preprocessor took 34.18ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 87.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:46:22,258 INFO L158 Benchmark]: IcfgBuilder took 402.80ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 62.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 01:46:22,258 INFO L158 Benchmark]: TraceAbstraction took 986.11ms. Allocated memory is still 142.6MB. Free memory was 61.2MB in the beginning and 58.3MB in the end (delta: 2.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2025-03-04 01:46:22,258 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 142.6MB. Free memory was 58.3MB in the beginning and 58.3MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:46:22,259 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.19ms. Allocated memory is still 201.3MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.08ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 93.2MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.75ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 89.7MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.18ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 87.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 402.80ms. Allocated memory is still 142.6MB. Free memory was 87.5MB in the beginning and 62.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 986.11ms. Allocated memory is still 142.6MB. Free memory was 61.2MB in the beginning and 58.3MB in the end (delta: 2.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 142.6MB. Free memory was 58.3MB in the beginning and 58.3MB in the end (delta: 41.6kB). 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 someBinaryArithmeticDOUBLEoperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 98. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L45] double* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] unsigned char* WrapperStruct0_var_1_2_Pointer = &(WrapperStruct0.var_1_2); [L47] double* WrapperStruct0_var_1_3_Pointer = &(WrapperStruct0.var_1_3); [L48] double* WrapperStruct0_var_1_4_Pointer = &(WrapperStruct0.var_1_4); [L49] double* WrapperStruct0_var_1_5_Pointer = &(WrapperStruct0.var_1_5); [L50] unsigned char* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L51] unsigned char* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L52] unsigned char* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L53] unsigned short int* WrapperStruct0_var_1_13_Pointer = &(WrapperStruct0.var_1_13); [L54] double last_1_WrapperStruct0_var_1_5 = 5.25; [L55] unsigned char last_1_WrapperStruct0_var_1_10 = 100; [L56] unsigned short int last_1_WrapperStruct0_var_1_13 = 5; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=0, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L107] EXPR WrapperStruct0.var_1_5 [L107] last_1_WrapperStruct0_var_1_5 = WrapperStruct0.var_1_5 [L108] EXPR WrapperStruct0.var_1_10 [L108] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L109] EXPR WrapperStruct0.var_1_13 [L109] last_1_WrapperStruct0_var_1_13 = WrapperStruct0.var_1_13 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L92] WrapperStruct0.var_1_2 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L93] CALL assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L93] RET assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] CALL assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] RET assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L95] WrapperStruct0.var_1_3 = __VERIFIER_nondet_double() [L96] EXPR WrapperStruct0.var_1_3 [L96] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F [L96] EXPR WrapperStruct0.var_1_3 [L96] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] CALL assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] RET assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L97] WrapperStruct0.var_1_4 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct0.var_1_4 [L98] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F [L98] EXPR WrapperStruct0.var_1_4 [L98] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] CALL assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] RET assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L99] WrapperStruct0.var_1_9 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L100] CALL assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L100] RET assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L101] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L101] CALL assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L101] RET assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L102] WrapperStruct0.var_1_12 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] CALL assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] RET assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L104] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L104] CALL assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L104] RET assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L120] RET updateVariables() [L121] CALL step() [L60] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L60] COND FALSE !((*(WrapperStruct0_var_1_9_Pointer))) [L65] COND FALSE !((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L70] EXPR \read(*WrapperStruct0_var_1_2_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L70] COND TRUE ! (*(WrapperStruct0_var_1_2_Pointer)) [L71] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L71] EXPR \read(*WrapperStruct0_var_1_4_Pointer) [L71] (*(WrapperStruct0_var_1_1_Pointer)) = ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))) [L75] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_4_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_1_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L75] COND FALSE !(((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) [L88] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L88] (*(WrapperStruct0_var_1_5_Pointer)) = (*(WrapperStruct0_var_1_3_Pointer)) [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR \read(*WrapperStruct0_var_1_2_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR (! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer))))))) [L112] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L112] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L112] EXPR \read(*WrapperStruct0_var_1_4_Pointer) [L112] EXPR (! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer))))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR (((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR (((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) ? ((((*(WrapperStruct0_var_1_4_Pointer)) * ((*(WrapperStruct0_var_1_3_Pointer)) - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) ? ((((*(WrapperStruct0_var_1_4_Pointer)) * ((*(WrapperStruct0_var_1_3_Pointer)) - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112-L113] return ((((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) ? ((((*(WrapperStruct0_var_1_4_Pointer)) * ((*(WrapperStruct0_var_1_3_Pointer)) - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 108 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 304 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 210/224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:46:22,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:46:24,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:46:24,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:46:24,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:46:24,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:46:24,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:46:24,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:46:24,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:46:24,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:46:24,168 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:46:24,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:46:24,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:46:24,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:46:24,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:46:24,169 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:46:24,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:46:24,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:46:24,170 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:46:24,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:46:24,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:46:24,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:46:24,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:46:24,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:46:24,170 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:46:24,170 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:46:24,171 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:46:24,171 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:46:24,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:46:24,171 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:46:24,171 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:46:24,171 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:46:24,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:46:24,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:46:24,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:46:24,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:46:24,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:46:24,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:46:24,172 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:46:24,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:46:24,172 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:46:24,172 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:46:24,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:46:24,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:46:24,172 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:46:24,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:46:24,173 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 [2025-03-04 01:46:24,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:46:24,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:46:24,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:46:24,425 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:46:24,425 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:46:24,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2025-03-04 01:46:25,528 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74dee6cd6/47dc8f61d63a470f842742c19d78e5ce/FLAGe5c441613 [2025-03-04 01:46:25,781 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:46:25,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2025-03-04 01:46:25,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74dee6cd6/47dc8f61d63a470f842742c19d78e5ce/FLAGe5c441613 [2025-03-04 01:46:26,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74dee6cd6/47dc8f61d63a470f842742c19d78e5ce [2025-03-04 01:46:26,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:46:26,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:46:26,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:46:26,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:46:26,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:46:26,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:46:26" (1/1) ... [2025-03-04 01:46:26,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2426e482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:26, skipping insertion in model container [2025-03-04 01:46:26,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:46:26" (1/1) ... [2025-03-04 01:46:26,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:46:26,205 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i[916,929] [2025-03-04 01:46:26,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:46:26,251 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:46:26,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i[916,929] [2025-03-04 01:46:26,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:46:26,297 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:46:26,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:26 WrapperNode [2025-03-04 01:46:26,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:46:26,298 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:46:26,298 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:46:26,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:46:26,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:26" (1/1) ... [2025-03-04 01:46:26,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:26" (1/1) ... [2025-03-04 01:46:26,333 INFO L138 Inliner]: procedures = 33, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 365 [2025-03-04 01:46:26,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:46:26,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:46:26,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:46:26,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:46:26,340 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:26" (1/1) ... [2025-03-04 01:46:26,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:26" (1/1) ... [2025-03-04 01:46:26,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:26" (1/1) ... [2025-03-04 01:46:26,364 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2025-03-04 01:46:26,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:26" (1/1) ... [2025-03-04 01:46:26,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:26" (1/1) ... [2025-03-04 01:46:26,372 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:26" (1/1) ... [2025-03-04 01:46:26,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:26" (1/1) ... [2025-03-04 01:46:26,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:26" (1/1) ... [2025-03-04 01:46:26,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:26" (1/1) ... [2025-03-04 01:46:26,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:46:26,382 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:46:26,382 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:46:26,382 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:46:26,383 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:26" (1/1) ... [2025-03-04 01:46:26,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:46:26,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:46:26,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:46:26,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:46:26,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:46:26,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:46:26,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:46:26,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:46:26,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:46:26,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:46:26,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:46:26,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:46:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:46:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:46:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:46:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:46:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:46:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:46:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:46:26,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:46:26,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:46:26,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:46:26,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:46:26,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:46:26,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:46:26,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:46:26,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:46:26,537 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:46:26,539 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:46:45,612 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc property_#t~mem54#1;havoc property_#t~ite62#1;havoc property_#t~mem57#1;havoc property_#t~mem55#1;havoc property_#t~mem56#1;havoc property_#t~mem61#1;havoc property_#t~mem58#1;havoc property_#t~ite60#1;havoc property_#t~mem59#1;havoc property_#t~mem65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem66#1;havoc property_#t~ite82#1;havoc property_#t~mem67#1;havoc property_#t~ite79#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite76#1;havoc property_#t~mem70#1;havoc property_#t~ite73#1;havoc property_#t~mem72#1;havoc property_#t~mem71#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~short83#1;havoc property_#t~ite87#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~ite94#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~short95#1; [2025-03-04 01:46:45,635 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2025-03-04 01:46:45,636 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:46:45,643 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:46:45,643 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:46:45,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:46:45 BoogieIcfgContainer [2025-03-04 01:46:45,643 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:46:45,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:46:45,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:46:45,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:46:45,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:46:26" (1/3) ... [2025-03-04 01:46:45,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afda458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:46:45, skipping insertion in model container [2025-03-04 01:46:45,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:46:26" (2/3) ... [2025-03-04 01:46:45,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7afda458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:46:45, skipping insertion in model container [2025-03-04 01:46:45,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:46:45" (3/3) ... [2025-03-04 01:46:45,649 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-0.i [2025-03-04 01:46:45,666 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:46:45,667 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-0.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:46:45,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:46:45,712 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;@3267e240, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:46:45,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:46:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 01:46:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 01:46:45,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:46:45,722 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:46:45,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:46:45,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:46:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash 405337358, now seen corresponding path program 1 times [2025-03-04 01:46:45,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:46:45,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448022020] [2025-03-04 01:46:45,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:46:45,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:46:45,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:46:45,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:46:45,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:46:45,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 01:46:46,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 01:46:46,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:46:46,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:46:46,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:46:46,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:46:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-04 01:46:46,203 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:46:46,204 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:46:46,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448022020] [2025-03-04 01:46:46,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448022020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:46:46,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:46:46,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:46:46,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272175545] [2025-03-04 01:46:46,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:46:46,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:46:46,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:46:46,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:46:46,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:46:46,220 INFO L87 Difference]: Start difference. First operand has 84 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:46:46,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:46:46,234 INFO L93 Difference]: Finished difference Result 159 states and 242 transitions. [2025-03-04 01:46:46,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:46:46,236 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2025-03-04 01:46:46,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:46:46,239 INFO L225 Difference]: With dead ends: 159 [2025-03-04 01:46:46,240 INFO L226 Difference]: Without dead ends: 78 [2025-03-04 01:46:46,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:46:46,243 INFO L435 NwaCegarLoop]: 108 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, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:46:46,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:46:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-04 01:46:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-04 01:46:46,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 01:46:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2025-03-04 01:46:46,269 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 78 [2025-03-04 01:46:46,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:46:46,270 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2025-03-04 01:46:46,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:46:46,270 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2025-03-04 01:46:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 01:46:46,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:46:46,272 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:46:46,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:46:46,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:46:46,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:46:46,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:46:46,473 INFO L85 PathProgramCache]: Analyzing trace with hash 650052084, now seen corresponding path program 1 times [2025-03-04 01:46:46,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:46:46,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420243264] [2025-03-04 01:46:46,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:46:46,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:46:46,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:46:46,476 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:46:46,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:46:46,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 01:46:46,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 01:46:46,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:46:46,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:46:46,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:46:46,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:46:47,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:46:47,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-04 01:46:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 01:46:47,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:46:47,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:46:47,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420243264] [2025-03-04 01:46:47,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420243264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:46:47,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:46:47,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:46:47,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365556212] [2025-03-04 01:46:47,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:46:47,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:46:47,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:46:47,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:46:47,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:46:47,241 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:46:51,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:46:53,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:46:55,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:46:58,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:07,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:11,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:15,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:19,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:22,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:22,899 INFO L93 Difference]: Finished difference Result 154 states and 214 transitions. [2025-03-04 01:47:22,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:47:22,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2025-03-04 01:47:22,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:22,935 INFO L225 Difference]: With dead ends: 154 [2025-03-04 01:47:22,935 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 01:47:22,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:47:22,936 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 94 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:22,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 284 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 5 Unknown, 0 Unchecked, 35.5s Time] [2025-03-04 01:47:22,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 01:47:22,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-03-04 01:47:22,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.338235294117647) internal successors, (91), 68 states have internal predecessors, (91), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 01:47:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2025-03-04 01:47:22,940 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 78 [2025-03-04 01:47:22,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:22,941 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2025-03-04 01:47:22,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:47:22,941 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2025-03-04 01:47:22,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 01:47:22,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:22,943 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:22,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:47:23,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:47:23,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:23,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:23,145 INFO L85 PathProgramCache]: Analyzing trace with hash 925091922, now seen corresponding path program 1 times [2025-03-04 01:47:23,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:47:23,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [783249772] [2025-03-04 01:47:23,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:23,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:47:23,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:47:23,148 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:47:23,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:47:23,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 01:47:23,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 01:47:23,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:47:23,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:47:23,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:47:23,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:47:23,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:47:23,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-04 01:47:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 01:47:23,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:47:23,993 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:47:23,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [783249772] [2025-03-04 01:47:23,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [783249772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:47:23,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:47:23,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:47:23,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634553038] [2025-03-04 01:47:23,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:47:23,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:47:23,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:47:23,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:47:23,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:47:23,994 INFO L87 Difference]: Start difference. First operand 78 states and 107 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:47:27,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:31,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:34,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:37,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:38,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:40,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:45,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:49,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:53,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:57,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 01:47:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:47:57,465 INFO L93 Difference]: Finished difference Result 154 states and 212 transitions. [2025-03-04 01:47:57,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:47:57,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2025-03-04 01:47:57,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:47:57,501 INFO L225 Difference]: With dead ends: 154 [2025-03-04 01:47:57,501 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 01:47:57,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:47:57,502 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 85 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:47:57,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 278 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 4 Unknown, 0 Unchecked, 33.4s Time] [2025-03-04 01:47:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 01:47:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-03-04 01:47:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 68 states have internal predecessors, (90), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 01:47:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 106 transitions. [2025-03-04 01:47:57,506 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 106 transitions. Word has length 80 [2025-03-04 01:47:57,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:47:57,507 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 106 transitions. [2025-03-04 01:47:57,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:47:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2025-03-04 01:47:57,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 01:47:57,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:47:57,508 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:47:57,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:47:57,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:47:57,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:47:57,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:47:57,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2105115020, now seen corresponding path program 1 times [2025-03-04 01:47:57,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:47:57,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291678975] [2025-03-04 01:47:57,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:47:57,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:47:57,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:47:57,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:47:57,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:47:57,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 01:48:03,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 01:48:03,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:03,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:03,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 01:48:03,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:04,876 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