./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:29:16,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:29:16,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:29:16,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:29:16,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:29:16,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:29:16,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:29:16,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:29:16,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:29:16,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:29:16,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:29:16,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:29:16,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:29:16,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:29:16,672 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:29:16,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:29:16,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:29:16,673 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:29:16,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:29:16,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:29:16,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:29:16,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:29:16,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:29:16,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:29:16,673 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:29:16,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:29:16,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:29:16,674 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:29:16,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:29:16,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:29:16,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:29:16,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:29:16,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:29:16,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:29:16,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:29:16,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:29:16,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:29:16,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:29:16,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:29:16,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:29:16,676 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:29:16,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:29:16,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:29:16,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:29:16,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:29:16,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:29:16,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:29:16,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:29:16,677 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 [2025-01-09 15:29:16,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:29:17,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:29:17,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:29:17,007 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:29:17,007 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:29:17,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2025-01-09 15:29:18,441 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09cdb35c9/7648bd14ebcd428aa8e782a4ebc42a1e/FLAGf945a7948 [2025-01-09 15:29:18,707 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:29:18,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2025-01-09 15:29:18,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09cdb35c9/7648bd14ebcd428aa8e782a4ebc42a1e/FLAGf945a7948 [2025-01-09 15:29:19,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09cdb35c9/7648bd14ebcd428aa8e782a4ebc42a1e [2025-01-09 15:29:19,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:29:19,022 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:29:19,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:29:19,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:29:19,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:29:19,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:29:19" (1/1) ... [2025-01-09 15:29:19,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5421906c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19, skipping insertion in model container [2025-01-09 15:29:19,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:29:19" (1/1) ... [2025-01-09 15:29:19,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:29:19,174 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2025-01-09 15:29:19,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:29:19,255 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:29:19,264 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2025-01-09 15:29:19,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:29:19,329 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:29:19,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19 WrapperNode [2025-01-09 15:29:19,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:29:19,331 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:29:19,331 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:29:19,331 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:29:19,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19" (1/1) ... [2025-01-09 15:29:19,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19" (1/1) ... [2025-01-09 15:29:19,400 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 515 [2025-01-09 15:29:19,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:29:19,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:29:19,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:29:19,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:29:19,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19" (1/1) ... [2025-01-09 15:29:19,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19" (1/1) ... [2025-01-09 15:29:19,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19" (1/1) ... [2025-01-09 15:29:19,456 INFO L175 MemorySlicer]: Split 134 memory accesses to 5 slices as follows [2, 64, 9, 16, 43]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 8, 1, 1, 5]. The 18 writes are split as follows [0, 8, 1, 1, 8]. [2025-01-09 15:29:19,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19" (1/1) ... [2025-01-09 15:29:19,460 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19" (1/1) ... [2025-01-09 15:29:19,474 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19" (1/1) ... [2025-01-09 15:29:19,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19" (1/1) ... [2025-01-09 15:29:19,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19" (1/1) ... [2025-01-09 15:29:19,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19" (1/1) ... [2025-01-09 15:29:19,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19" (1/1) ... [2025-01-09 15:29:19,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:29:19,495 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:29:19,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:29:19,495 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:29:19,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19" (1/1) ... [2025-01-09 15:29:19,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:29:19,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:29:19,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:29:19,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:29:19,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:29:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:29:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:29:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:29:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:29:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:29:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:29:19,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:29:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:29:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:29:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:29:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:29:19,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:29:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:29:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:29:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:29:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:29:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:29:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:29:19,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:29:19,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:29:19,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:29:19,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:29:19,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:29:19,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:29:19,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:29:19,566 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:29:19,566 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:29:19,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:29:19,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:29:19,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:29:19,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:29:19,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:29:19,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:29:19,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:29:19,721 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:29:19,724 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:29:20,270 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2025-01-09 15:29:20,270 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:29:20,283 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:29:20,285 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:29:20,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:29:20 BoogieIcfgContainer [2025-01-09 15:29:20,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:29:20,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:29:20,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:29:20,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:29:20,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:29:19" (1/3) ... [2025-01-09 15:29:20,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28402aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:29:20, skipping insertion in model container [2025-01-09 15:29:20,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:19" (2/3) ... [2025-01-09 15:29:20,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28402aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:29:20, skipping insertion in model container [2025-01-09 15:29:20,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:29:20" (3/3) ... [2025-01-09 15:29:20,295 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-98.i [2025-01-09 15:29:20,311 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:29:20,312 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-98.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:29:20,372 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:29:20,386 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;@207c6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:29:20,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:29:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:29:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 15:29:20,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:29:20,406 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:29:20,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:29:20,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:29:20,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1340741874, now seen corresponding path program 1 times [2025-01-09 15:29:20,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:29:20,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370392464] [2025-01-09 15:29:20,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:20,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:29:20,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:29:20,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:29:20,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:20,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:29:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 15:29:20,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:29:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370392464] [2025-01-09 15:29:20,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370392464] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:29:20,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758363379] [2025-01-09 15:29:20,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:20,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:29:20,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:29:20,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:29:20,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:29:20,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:29:21,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:29:21,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:21,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:29:21,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:29:21,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:29:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-01-09 15:29:21,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:29:21,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758363379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:29:21,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:29:21,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:29:21,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516172050] [2025-01-09 15:29:21,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:29:21,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:29:21,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:29:21,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:29:21,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:29:21,147 INFO L87 Difference]: Start difference. First operand has 122 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:29:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:29:21,175 INFO L93 Difference]: Finished difference Result 238 states and 370 transitions. [2025-01-09 15:29:21,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:29:21,176 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2025-01-09 15:29:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:29:21,181 INFO L225 Difference]: With dead ends: 238 [2025-01-09 15:29:21,182 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 15:29:21,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:29:21,187 INFO L435 NwaCegarLoop]: 174 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, 174 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:29:21,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:29:21,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 15:29:21,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-01-09 15:29:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:29:21,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2025-01-09 15:29:21,223 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 143 [2025-01-09 15:29:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:29:21,224 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2025-01-09 15:29:21,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:29:21,224 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2025-01-09 15:29:21,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 15:29:21,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:29:21,227 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:29:21,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:29:21,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:29:21,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:29:21,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:29:21,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1075757960, now seen corresponding path program 1 times [2025-01-09 15:29:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:29:21,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655165528] [2025-01-09 15:29:21,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:21,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:29:21,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:29:21,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:29:21,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:21,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:29:21,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805295809] [2025-01-09 15:29:21,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:21,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:29:21,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:29:21,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:29:21,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:29:21,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:29:22,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:29:22,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:22,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:29:22,094 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:29:22,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:29:22,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:29:22,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:22,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:29:22,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:29:22,453 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:29:22,455 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:29:22,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:29:22,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:29:22,660 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 15:29:22,757 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:29:22,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:29:22 BoogieIcfgContainer [2025-01-09 15:29:22,760 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:29:22,760 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:29:22,760 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:29:22,761 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:29:22,761 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:29:20" (3/4) ... [2025-01-09 15:29:22,763 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:29:22,764 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:29:22,765 INFO L158 Benchmark]: Toolchain (without parser) took 3742.91ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 72.4MB in the end (delta: 39.0MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2025-01-09 15:29:22,766 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:29:22,766 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.04ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 95.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:29:22,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.64ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 92.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:29:22,768 INFO L158 Benchmark]: Boogie Preprocessor took 89.76ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 87.8MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:29:22,768 INFO L158 Benchmark]: RCFGBuilder took 790.78ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 55.7MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:29:22,769 INFO L158 Benchmark]: TraceAbstraction took 2471.52ms. Allocated memory is still 142.6MB. Free memory was 54.8MB in the beginning and 72.4MB in the end (delta: -17.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:29:22,769 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 72.4MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:29:22,771 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.93ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.04ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 95.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.64ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 92.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 89.76ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 87.8MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 790.78ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 55.7MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2471.52ms. Allocated memory is still 142.6MB. Free memory was 54.8MB in the beginning and 72.4MB in the end (delta: -17.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 72.4MB in the end (delta: 21.0kB). 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 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 66. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L22-L24] double double_Array_0[2][2][2] = { {{7.25, 0.6}, {7.5, 63.5}}, {{4.4, 9999999.5}, {2.3, 4.8}} }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -1 }; [L25-L27] signed long int signed_long_int_Array_0[1] = { -1 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { 10 }; [L28-L30] signed short int signed_short_int_Array_0[1] = { 10 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[5] = { 128, 0, 25, 4078799264, 500 }; [L34] unsigned long int last_1_unsigned_long_int_Array_0_4_ = 500; VAL [double_Array_0={4:0}, isInitial=0, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L98] isInitial = 1 [L99] FCALL initially() [L101] CALL updateLastVariables() [L91] EXPR unsigned_long_int_Array_0[4] [L91] last_1_unsigned_long_int_Array_0_4_ = unsigned_long_int_Array_0[4] [L101] RET updateLastVariables() [L102] CALL updateVariables() [L61] double_Array_0[0][0][0] = __VERIFIER_nondet_double() [L62] EXPR double_Array_0[0][0][0] [L62] EXPR double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] EXPR double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F [L62] EXPR double_Array_0[0][0][0] [L62] EXPR double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] EXPR (double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] EXPR (double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] CALL assume_abort_if_not((double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L62] RET assume_abort_if_not((double_Array_0[0][0][0] >= -115292.1504606845700e+13F && double_Array_0[0][0][0] <= -1.0e-20F) || (double_Array_0[0][0][0] <= 1152921.504606845700e+12F && double_Array_0[0][0][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L63] double_Array_0[1][0][0] = __VERIFIER_nondet_double() [L64] EXPR double_Array_0[1][0][0] [L64] EXPR double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] EXPR double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F [L64] EXPR double_Array_0[1][0][0] [L64] EXPR double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] EXPR (double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] EXPR (double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] CALL assume_abort_if_not((double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L64] RET assume_abort_if_not((double_Array_0[1][0][0] >= -115292.1504606845700e+13F && double_Array_0[1][0][0] <= -1.0e-20F) || (double_Array_0[1][0][0] <= 1152921.504606845700e+12F && double_Array_0[1][0][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L65] double_Array_0[0][1][0] = __VERIFIER_nondet_double() [L66] EXPR double_Array_0[0][1][0] [L66] EXPR double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] EXPR double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F [L66] EXPR double_Array_0[0][1][0] [L66] EXPR double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] EXPR (double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] EXPR (double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] CALL assume_abort_if_not((double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L66] RET assume_abort_if_not((double_Array_0[0][1][0] >= -230584.3009213691390e+13F && double_Array_0[0][1][0] <= -1.0e-20F) || (double_Array_0[0][1][0] <= 2305843.009213691390e+12F && double_Array_0[0][1][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L67] double_Array_0[1][1][0] = __VERIFIER_nondet_double() [L68] EXPR double_Array_0[1][1][0] [L68] EXPR double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] EXPR double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F [L68] EXPR double_Array_0[1][1][0] [L68] EXPR double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] EXPR (double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] EXPR (double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] CALL assume_abort_if_not((double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L68] RET assume_abort_if_not((double_Array_0[1][1][0] >= -230584.3009213691390e+13F && double_Array_0[1][1][0] <= -1.0e-20F) || (double_Array_0[1][1][0] <= 2305843.009213691390e+12F && double_Array_0[1][1][0] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L69] double_Array_0[1][0][1] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[1][0][1] [L70] EXPR double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] EXPR double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F [L70] EXPR double_Array_0[1][0][1] [L70] EXPR double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] EXPR (double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] CALL assume_abort_if_not((double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L70] RET assume_abort_if_not((double_Array_0[1][0][1] >= 0.0F && double_Array_0[1][0][1] <= -1.0e-20F) || (double_Array_0[1][0][1] <= 9223372.036854765600e+12F && double_Array_0[1][0][1] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L71] double_Array_0[0][1][1] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[0][1][1] [L72] EXPR double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] EXPR double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F [L72] EXPR double_Array_0[0][1][1] [L72] EXPR double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] EXPR (double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] EXPR (double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F ) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F )) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L72] RET assume_abort_if_not((double_Array_0[0][1][1] >= 0.0F && double_Array_0[0][1][1] <= -1.0e-20F) || (double_Array_0[0][1][1] <= 9223372.036854765600e+12F && double_Array_0[0][1][1] >= 1.0e-20F )) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L73] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L74] EXPR signed_long_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L74] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -2147483648) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] EXPR signed_long_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L75] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 2147483647) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] EXPR signed_long_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] CALL assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L76] RET assume_abort_if_not(signed_long_int_Array_0[0] != 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L77] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L78] EXPR signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L78] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] EXPR signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L79] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L80] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[1] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] EXPR unsigned_long_int_Array_0[1] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L83] unsigned_long_int_Array_0[2] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[2] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] >= 0) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[2] >= 0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] EXPR unsigned_long_int_Array_0[2] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] <= 2147483647) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[2] <= 2147483647) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L86] unsigned_long_int_Array_0[3] = __VERIFIER_nondet_ulong() [L87] EXPR unsigned_long_int_Array_0[3] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] >= 2147483647) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[3] >= 2147483647) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] EXPR unsigned_long_int_Array_0[3] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_long_int_Array_0[3] <= 4294967294) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L102] RET updateVariables() [L103] CALL step() [L38] EXPR double_Array_0[0][1][1] [L38] EXPR double_Array_0[1][0][1] [L38] double_Array_0[1][1][1] = (double_Array_0[0][1][1] - double_Array_0[1][0][1]) [L39] EXPR unsigned_long_int_Array_0[1] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L39] COND FALSE !(((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) [L46] EXPR unsigned_long_int_Array_0[2] [L46] unsigned_long_int_Array_0[4] = unsigned_long_int_Array_0[2] [L48] EXPR unsigned_long_int_Array_0[4] [L48] EXPR signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L48] EXPR unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L48] EXPR signed_long_int_Array_0[0] [L48] unsigned long int stepLocal_0 = (unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0]; [L49] COND FALSE !(8 < stepLocal_0) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L52] EXPR double_Array_0[0][1][1] [L52] EXPR double_Array_0[1][0][0] VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L52] COND FALSE !(double_Array_0[0][1][1] < double_Array_0[1][0][0]) [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR double_Array_0[1][1][1] [L94] EXPR double_Array_0[0][1][1] [L94] EXPR double_Array_0[1][0][1] [L94] EXPR (double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR (double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR ((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR ((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR (((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1)) && ((((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) ? ((last_1_unsigned_long_int_Array_0_4_ > signed_long_int_Array_0[0]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) (signed_short_int_Array_0[0] + unsigned_long_int_Array_0[2]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[2]))) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94] EXPR (((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1)) && ((((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) ? ((last_1_unsigned_long_int_Array_0_4_ > signed_long_int_Array_0[0]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) (signed_short_int_Array_0[0] + unsigned_long_int_Array_0[2]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[2]))) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L94-L95] return (((double_Array_0[1][1][1] == ((double) (double_Array_0[0][1][1] - double_Array_0[1][0][1]))) && ((8 < ((unsigned_long_int_Array_0[4] >> signed_short_int_Array_0[0]) / signed_long_int_Array_0[0])) ? (double_Array_0[0][0][1] == ((double) (((double_Array_0[1][0][0] + double_Array_0[0][0][0]) + ((((double_Array_0[0][1][0]) < (1.9)) ? (double_Array_0[0][1][0]) : (1.9)))) + (99.125 + double_Array_0[1][1][0])))) : 1)) && ((double_Array_0[0][1][1] < double_Array_0[1][0][0]) ? ((((- unsigned_long_int_Array_0[4]) <= signed_short_int_Array_0[0]) || (double_Array_0[0][0][1] < double_Array_0[0][1][0])) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) ((((signed_short_int_Array_0[0]) < (unsigned_long_int_Array_0[1])) ? (signed_short_int_Array_0[0]) : (unsigned_long_int_Array_0[1]))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[3] - signed_short_int_Array_0[0])))) : 1)) && ((((((-128) < (last_1_unsigned_long_int_Array_0_4_)) ? (-128) : (last_1_unsigned_long_int_Array_0_4_))) < unsigned_long_int_Array_0[1]) ? ((last_1_unsigned_long_int_Array_0_4_ > signed_long_int_Array_0[0]) ? (unsigned_long_int_Array_0[4] == ((unsigned long int) (signed_short_int_Array_0[0] + unsigned_long_int_Array_0[2]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[3]))) : (unsigned_long_int_Array_0[4] == ((unsigned long int) unsigned_long_int_Array_0[2]))) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] [L19] reach_error() VAL [double_Array_0={4:0}, isInitial=1, last_1_unsigned_long_int_Array_0_4_=500, signed_long_int_Array_0={5:0}, signed_short_int_Array_0={6:0}, unsigned_long_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 2, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 174 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, 174 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1056/1088 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:29:22,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:29:25,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:29:25,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:29:25,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:29:25,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:29:25,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:29:25,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:29:25,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:29:25,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:29:25,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:29:25,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:29:25,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:29:25,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:29:25,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:29:25,257 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:29:25,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:29:25,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:29:25,258 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:29:25,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:29:25,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:29:25,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:29:25,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:29:25,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:29:25,258 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:29:25,259 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:29:25,259 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:29:25,259 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:29:25,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:29:25,259 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:29:25,259 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:29:25,259 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:29:25,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:29:25,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:29:25,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:29:25,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:29:25,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:29:25,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:29:25,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:29:25,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:29:25,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:29:25,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:29:25,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:29:25,261 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:29:25,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:29:25,261 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:29:25,261 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:29:25,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:29:25,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:29:25,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:29:25,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:29:25,262 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94402a909576ff0f6dec6fb8b106268679f88adb1b4c5fc615242f98a35b2243 [2025-01-09 15:29:25,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:29:25,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:29:25,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:29:25,575 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:29:25,576 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:29:25,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2025-01-09 15:29:26,966 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46944fd95/95276767a6534401875e4d66e9a4f415/FLAGce2fd2758 [2025-01-09 15:29:27,221 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:29:27,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i [2025-01-09 15:29:27,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46944fd95/95276767a6534401875e4d66e9a4f415/FLAGce2fd2758 [2025-01-09 15:29:27,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/46944fd95/95276767a6534401875e4d66e9a4f415 [2025-01-09 15:29:27,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:29:27,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:29:27,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:29:27,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:29:27,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:29:27,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:29:27" (1/1) ... [2025-01-09 15:29:27,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a047eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27, skipping insertion in model container [2025-01-09 15:29:27,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:29:27" (1/1) ... [2025-01-09 15:29:27,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:29:27,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2025-01-09 15:29:27,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:29:27,541 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:29:27,554 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-98.i[916,929] [2025-01-09 15:29:27,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:29:27,663 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:29:27,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27 WrapperNode [2025-01-09 15:29:27,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:29:27,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:29:27,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:29:27,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:29:27,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27" (1/1) ... [2025-01-09 15:29:27,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27" (1/1) ... [2025-01-09 15:29:27,749 INFO L138 Inliner]: procedures = 36, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2025-01-09 15:29:27,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:29:27,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:29:27,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:29:27,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:29:27,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27" (1/1) ... [2025-01-09 15:29:27,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27" (1/1) ... [2025-01-09 15:29:27,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27" (1/1) ... [2025-01-09 15:29:27,806 INFO L175 MemorySlicer]: Split 134 memory accesses to 5 slices as follows [2, 64, 9, 16, 43]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 8, 1, 1, 5]. The 18 writes are split as follows [0, 8, 1, 1, 8]. [2025-01-09 15:29:27,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27" (1/1) ... [2025-01-09 15:29:27,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27" (1/1) ... [2025-01-09 15:29:27,844 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27" (1/1) ... [2025-01-09 15:29:27,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27" (1/1) ... [2025-01-09 15:29:27,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27" (1/1) ... [2025-01-09 15:29:27,866 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27" (1/1) ... [2025-01-09 15:29:27,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27" (1/1) ... [2025-01-09 15:29:27,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:29:27,879 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:29:27,879 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:29:27,879 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:29:27,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27" (1/1) ... [2025-01-09 15:29:27,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:29:27,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:29:27,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:29:27,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:29:27,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:29:27,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:29:27,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:29:27,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:29:27,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:29:27,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:29:27,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:29:27,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:29:27,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:29:27,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:29:27,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:29:27,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:29:27,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:29:27,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:29:27,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:29:27,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:29:27,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:29:27,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:29:27,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:29:27,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:29:27,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:29:27,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 15:29:27,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 15:29:27,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-09 15:29:27,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-09 15:29:27,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:29:27,947 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:29:27,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:29:27,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:29:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:29:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:29:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:29:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:29:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:29:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:29:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:29:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-09 15:29:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-09 15:29:27,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-01-09 15:29:28,101 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:29:28,103 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:29:37,355 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-01-09 15:29:37,356 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:29:37,365 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:29:37,365 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:29:37,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:29:37 BoogieIcfgContainer [2025-01-09 15:29:37,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:29:37,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:29:37,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:29:37,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:29:37,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:29:27" (1/3) ... [2025-01-09 15:29:37,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e92285c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:29:37, skipping insertion in model container [2025-01-09 15:29:37,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:27" (2/3) ... [2025-01-09 15:29:37,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e92285c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:29:37, skipping insertion in model container [2025-01-09 15:29:37,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:29:37" (3/3) ... [2025-01-09 15:29:37,374 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-98.i [2025-01-09 15:29:37,385 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:29:37,387 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-98.i that has 2 procedures, 116 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:29:37,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:29:37,454 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;@188d7ec8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:29:37,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:29:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:29:37,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:29:37,469 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:29:37,469 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:29:37,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:29:37,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:29:37,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1769533571, now seen corresponding path program 1 times [2025-01-09 15:29:37,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:29:37,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128914536] [2025-01-09 15:29:37,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:37,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:29:37,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:29:37,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:29:37,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:29:37,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:29:38,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:29:38,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:38,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:29:38,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:29:38,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:29:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-01-09 15:29:38,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:29:38,089 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:29:38,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128914536] [2025-01-09 15:29:38,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128914536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:29:38,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:29:38,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:29:38,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107776670] [2025-01-09 15:29:38,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:29:38,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:29:38,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:29:38,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:29:38,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:29:38,117 INFO L87 Difference]: Start difference. First operand has 116 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 97 states have internal predecessors, (137), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:29:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:29:38,150 INFO L93 Difference]: Finished difference Result 226 states and 354 transitions. [2025-01-09 15:29:38,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:29:38,152 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2025-01-09 15:29:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:29:38,156 INFO L225 Difference]: With dead ends: 226 [2025-01-09 15:29:38,157 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 15:29:38,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:29:38,161 INFO L435 NwaCegarLoop]: 166 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, 166 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:29:38,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:29:38,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 15:29:38,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-09 15:29:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:29:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions. [2025-01-09 15:29:38,224 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 141 [2025-01-09 15:29:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:29:38,224 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 166 transitions. [2025-01-09 15:29:38,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:29:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions. [2025-01-09 15:29:38,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:29:38,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:29:38,228 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:29:38,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:29:38,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:29:38,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:29:38,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:29:38,429 INFO L85 PathProgramCache]: Analyzing trace with hash -938567571, now seen corresponding path program 1 times [2025-01-09 15:29:38,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:29:38,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026996256] [2025-01-09 15:29:38,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:38,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:29:38,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:29:38,432 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:29:38,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:29:38,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:29:38,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:29:38,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:38,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:29:38,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:29:38,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:29:39,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:29:39,547 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-01-09 15:29:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-01-09 15:29:39,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:29:39,662 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:29:39,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026996256] [2025-01-09 15:29:39,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026996256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:29:39,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:29:39,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:29:39,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154523283] [2025-01-09 15:29:39,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:29:39,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:29:39,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:29:39,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:29:39,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:29:39,666 INFO L87 Difference]: Start difference. First operand 113 states and 166 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:29:45,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:29:48,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:29:50,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:29:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:29:50,151 INFO L93 Difference]: Finished difference Result 224 states and 330 transitions. [2025-01-09 15:29:50,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:29:50,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2025-01-09 15:29:50,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:29:50,155 INFO L225 Difference]: With dead ends: 224 [2025-01-09 15:29:50,155 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 15:29:50,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:29:50,156 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 133 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:29:50,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 482 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 1 Unknown, 0 Unchecked, 10.3s Time] [2025-01-09 15:29:50,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 15:29:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-01-09 15:29:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:29:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2025-01-09 15:29:50,170 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 141 [2025-01-09 15:29:50,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:29:50,171 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2025-01-09 15:29:50,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:29:50,171 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2025-01-09 15:29:50,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 15:29:50,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:29:50,173 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:29:50,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 15:29:50,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:29:50,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:29:50,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:29:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash 896008135, now seen corresponding path program 1 times [2025-01-09 15:29:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:29:50,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280904179] [2025-01-09 15:29:50,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:50,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:29:50,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:29:50,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:29:50,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 15:29:50,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 15:29:50,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 15:29:50,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:50,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:29:50,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:29:50,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:29:51,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:29:51,330 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-01-09 15:29:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-01-09 15:29:51,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:29:51,391 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:29:51,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280904179] [2025-01-09 15:29:51,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280904179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:29:51,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:29:51,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:29:51,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180816119] [2025-01-09 15:29:51,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:29:51,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:29:51,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:29:51,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:29:51,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:29:51,392 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:29:56,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:29:57,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:30:01,290 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-01-09 15:30:01,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:01,442 INFO L93 Difference]: Finished difference Result 224 states and 328 transitions. [2025-01-09 15:30:01,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:30:01,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2025-01-09 15:30:01,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:01,445 INFO L225 Difference]: With dead ends: 224 [2025-01-09 15:30:01,445 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 15:30:01,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 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-01-09 15:30:01,446 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 125 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:01,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 475 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 1 Unknown, 0 Unchecked, 9.9s Time] [2025-01-09 15:30:01,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 15:30:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-01-09 15:30:01,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:30:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2025-01-09 15:30:01,455 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 143 [2025-01-09 15:30:01,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:01,457 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2025-01-09 15:30:01,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 15:30:01,458 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2025-01-09 15:30:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:30:01,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:01,461 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:30:01,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 15:30:01,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:30:01,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:01,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:01,663 INFO L85 PathProgramCache]: Analyzing trace with hash 75197931, now seen corresponding path program 1 times [2025-01-09 15:30:01,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:30:01,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246428858] [2025-01-09 15:30:01,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:01,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:30:01,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:30:01,666 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:30:01,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 15:30:01,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:30:02,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:30:02,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:30:02,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:30:02,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:30:02,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:30:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-01-09 15:30:02,231 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:30:02,231 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:30:02,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246428858] [2025-01-09 15:30:02,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246428858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:30:02,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:30:02,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:30:02,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303293372] [2025-01-09 15:30:02,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:30:02,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:30:02,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:30:02,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:30:02,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:30:02,233 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 15:30:02,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:30:02,867 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2025-01-09 15:30:02,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:30:02,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 145 [2025-01-09 15:30:02,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:30:02,877 INFO L225 Difference]: With dead ends: 227 [2025-01-09 15:30:02,877 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 15:30:02,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:30:02,878 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:30:02,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 677 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:30:02,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 15:30:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2025-01-09 15:30:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 15:30:02,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2025-01-09 15:30:02,887 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 145 [2025-01-09 15:30:02,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:30:02,888 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2025-01-09 15:30:02,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 15:30:02,888 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2025-01-09 15:30:02,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:30:02,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:30:02,890 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:30:02,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 15:30:03,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:30:03,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:30:03,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:30:03,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1801865299, now seen corresponding path program 1 times [2025-01-09 15:30:03,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:30:03,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186562600] [2025-01-09 15:30:03,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:30:03,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:30:03,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:30:03,093 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:30:03,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 15:30:03,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.