./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.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 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:09:54,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:09:54,477 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:09:54,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:09:54,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:09:54,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:09:54,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:09:54,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:09:54,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:09:54,515 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:09:54,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:09:54,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:09:54,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:09:54,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:09:54,516 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:09:54,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:09:54,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:09:54,517 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:09:54,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:09:54,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:09:54,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:09:54,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:09:54,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:09:54,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:09:54,518 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:09:54,518 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:09:54,518 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:09:54,518 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:09:54,518 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:09:54,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:09:54,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:09:54,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:09:54,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:09:54,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:09:54,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:09:54,519 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:09:54,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:09:54,520 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:09:54,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:09:54,520 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:09:54,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:09:54,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:09:54,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:09:54,520 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 -> 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a [2025-02-06 04:09:54,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:09:54,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:09:54,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:09:54,799 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:09:54,799 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:09:54,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2025-02-06 04:09:56,075 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5195985e7/6117a361c929472fbc43e3568a046d62/FLAG5ec2239da [2025-02-06 04:09:56,339 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:09:56,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2025-02-06 04:09:56,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5195985e7/6117a361c929472fbc43e3568a046d62/FLAG5ec2239da [2025-02-06 04:09:56,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5195985e7/6117a361c929472fbc43e3568a046d62 [2025-02-06 04:09:56,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:09:56,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:09:56,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:09:56,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:09:56,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:09:56,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:09:56" (1/1) ... [2025-02-06 04:09:56,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@688f4365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:56, skipping insertion in model container [2025-02-06 04:09:56,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:09:56" (1/1) ... [2025-02-06 04:09:56,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:09:56,791 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i[916,929] [2025-02-06 04:09:56,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:09:56,853 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:09:56,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i[916,929] [2025-02-06 04:09:56,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:09:56,913 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:09:56,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:56 WrapperNode [2025-02-06 04:09:56,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:09:56,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:09:56,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:09:56,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:09:56,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:56" (1/1) ... [2025-02-06 04:09:56,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:56" (1/1) ... [2025-02-06 04:09:56,975 INFO L138 Inliner]: procedures = 29, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 348 [2025-02-06 04:09:56,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:09:56,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:09:56,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:09:56,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:09:56,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:56" (1/1) ... [2025-02-06 04:09:56,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:56" (1/1) ... [2025-02-06 04:09:56,998 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:56" (1/1) ... [2025-02-06 04:09:57,023 INFO L175 MemorySlicer]: Split 86 memory accesses to 2 slices as follows [2, 84]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2025-02-06 04:09:57,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:56" (1/1) ... [2025-02-06 04:09:57,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:56" (1/1) ... [2025-02-06 04:09:57,042 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:56" (1/1) ... [2025-02-06 04:09:57,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:56" (1/1) ... [2025-02-06 04:09:57,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:56" (1/1) ... [2025-02-06 04:09:57,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:56" (1/1) ... [2025-02-06 04:09:57,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:09:57,058 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:09:57,058 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:09:57,058 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:09:57,059 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:56" (1/1) ... [2025-02-06 04:09:57,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:09:57,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:09:57,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:09:57,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:09:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 04:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 04:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 04:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 04:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 04:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 04:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:09:57,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:09:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:09:57,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:09:57,206 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:09:57,208 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:09:57,620 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem45#1;havoc property_#t~ite63#1;havoc property_#t~mem47#1;havoc property_#t~mem46#1;havoc property_#t~mem48#1;havoc property_#t~mem49#1;havoc property_#t~ite52#1;havoc property_#t~mem50#1;havoc property_#t~mem51#1;havoc property_#t~mem53#1;havoc property_#t~ite62#1;havoc property_#t~mem54#1;havoc property_#t~ite59#1;havoc property_#t~mem56#1;havoc property_#t~mem55#1;havoc property_#t~mem58#1;havoc property_#t~mem57#1;havoc property_#t~mem61#1;havoc property_#t~mem60#1;havoc property_#t~mem64#1;havoc property_#t~bitwise65#1;havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~short72#1;havoc property_#t~mem73#1;havoc property_#t~short74#1;havoc property_#t~mem76#1;havoc property_#t~mem75#1;havoc property_#t~short77#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem78#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem82#1;havoc property_#t~short84#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1; [2025-02-06 04:09:57,663 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-02-06 04:09:57,663 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:09:57,674 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:09:57,674 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:09:57,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:09:57 BoogieIcfgContainer [2025-02-06 04:09:57,674 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:09:57,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:09:57,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:09:57,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:09:57,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:09:56" (1/3) ... [2025-02-06 04:09:57,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46033191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:09:57, skipping insertion in model container [2025-02-06 04:09:57,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:09:56" (2/3) ... [2025-02-06 04:09:57,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46033191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:09:57, skipping insertion in model container [2025-02-06 04:09:57,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:09:57" (3/3) ... [2025-02-06 04:09:57,689 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-9.i [2025-02-06 04:09:57,700 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:09:57,701 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-9.i that has 2 procedures, 75 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:09:57,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:09:57,755 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;@10375eb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:09:57,756 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:09:57,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 04:09:57,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 04:09:57,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:57,765 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:09:57,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:57,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:57,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1371295227, now seen corresponding path program 1 times [2025-02-06 04:09:57,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:57,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770000808] [2025-02-06 04:09:57,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:57,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:57,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 04:09:57,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:09:57,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:57,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 04:09:58,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:58,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770000808] [2025-02-06 04:09:58,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770000808] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:09:58,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986223479] [2025-02-06 04:09:58,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:58,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:09:58,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:09:58,015 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:09:58,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:09:58,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 04:09:58,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:09:58,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:58,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:58,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:09:58,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:09:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 04:09:58,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:09:58,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986223479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:58,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:09:58,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:09:58,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983518748] [2025-02-06 04:09:58,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:58,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:09:58,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:58,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:09:58,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:09:58,244 INFO L87 Difference]: Start difference. First operand has 75 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 04:09:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:58,271 INFO L93 Difference]: Finished difference Result 144 states and 210 transitions. [2025-02-06 04:09:58,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:09:58,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2025-02-06 04:09:58,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:58,282 INFO L225 Difference]: With dead ends: 144 [2025-02-06 04:09:58,282 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 04:09:58,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:09:58,288 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:09:58,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:09:58,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 04:09:58,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-06 04:09:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 04:09:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2025-02-06 04:09:58,322 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 62 [2025-02-06 04:09:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:58,322 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2025-02-06 04:09:58,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 04:09:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2025-02-06 04:09:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 04:09:58,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:58,327 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:09:58,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:09:58,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 04:09:58,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:58,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:58,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1683261150, now seen corresponding path program 1 times [2025-02-06 04:09:58,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:58,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25019862] [2025-02-06 04:09:58,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:58,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:58,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 04:09:58,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:09:58,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:58,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:09:58,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:58,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25019862] [2025-02-06 04:09:58,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25019862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:58,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:09:58,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:09:58,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954089971] [2025-02-06 04:09:58,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:58,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:09:58,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:58,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:09:58,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:09:58,792 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:09:58,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:58,835 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2025-02-06 04:09:58,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:09:58,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-02-06 04:09:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:58,838 INFO L225 Difference]: With dead ends: 144 [2025-02-06 04:09:58,839 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 04:09:58,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:09:58,840 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:09:58,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:09:58,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 04:09:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-02-06 04:09:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 04:09:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2025-02-06 04:09:58,849 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 62 [2025-02-06 04:09:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:58,850 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2025-02-06 04:09:58,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:09:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2025-02-06 04:09:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 04:09:58,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:58,852 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:09:58,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:09:58,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:58,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:58,853 INFO L85 PathProgramCache]: Analyzing trace with hash -113690209, now seen corresponding path program 1 times [2025-02-06 04:09:58,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:58,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149171264] [2025-02-06 04:09:58,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:58,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:58,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 04:09:58,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:09:58,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:58,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 04:09:59,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:09:59,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149171264] [2025-02-06 04:09:59,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149171264] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:09:59,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093457125] [2025-02-06 04:09:59,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:59,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:09:59,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:09:59,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:09:59,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:09:59,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 04:09:59,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:09:59,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:09:59,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:09:59,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:09:59,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:09:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:09:59,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:09:59,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093457125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:09:59,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:09:59,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-06 04:09:59,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366020136] [2025-02-06 04:09:59,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:09:59,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:09:59,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:09:59,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:09:59,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:09:59,718 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:09:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:09:59,759 INFO L93 Difference]: Finished difference Result 148 states and 205 transitions. [2025-02-06 04:09:59,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:09:59,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-02-06 04:09:59,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:09:59,761 INFO L225 Difference]: With dead ends: 148 [2025-02-06 04:09:59,761 INFO L226 Difference]: Without dead ends: 77 [2025-02-06 04:09:59,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:09:59,762 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:09:59,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 275 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:09:59,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-06 04:09:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2025-02-06 04:09:59,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 04:09:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2025-02-06 04:09:59,774 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 62 [2025-02-06 04:09:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:09:59,776 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2025-02-06 04:09:59,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:09:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2025-02-06 04:09:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 04:09:59,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:09:59,780 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:09:59,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 04:09:59,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:09:59,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:09:59,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:09:59,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1921144672, now seen corresponding path program 1 times [2025-02-06 04:09:59,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:09:59,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699414132] [2025-02-06 04:09:59,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:09:59,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:09:59,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 04:10:00,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:10:00,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:00,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 04:10:00,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:00,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699414132] [2025-02-06 04:10:00,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699414132] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:00,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117095658] [2025-02-06 04:10:00,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:00,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:00,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:00,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:10:00,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:10:00,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 04:10:00,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:10:00,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:00,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:00,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:10:00,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:00,657 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:10:00,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:10:00,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117095658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:00,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:10:00,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-02-06 04:10:00,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788302073] [2025-02-06 04:10:00,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:00,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:10:00,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:00,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:10:00,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:10:00,661 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:00,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:00,688 INFO L93 Difference]: Finished difference Result 152 states and 209 transitions. [2025-02-06 04:10:00,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:10:00,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-02-06 04:10:00,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:00,689 INFO L225 Difference]: With dead ends: 152 [2025-02-06 04:10:00,690 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 04:10:00,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:10:00,691 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:00,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 276 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:10:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 04:10:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-02-06 04:10:00,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 04:10:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 106 transitions. [2025-02-06 04:10:00,696 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 106 transitions. Word has length 62 [2025-02-06 04:10:00,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:00,696 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 106 transitions. [2025-02-06 04:10:00,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:00,696 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2025-02-06 04:10:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 04:10:00,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:00,697 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:00,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:10:00,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:00,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:00,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1920221151, now seen corresponding path program 1 times [2025-02-06 04:10:00,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:00,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720410730] [2025-02-06 04:10:00,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:00,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:00,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 04:10:00,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:10:00,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:00,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 04:10:01,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:01,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720410730] [2025-02-06 04:10:01,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720410730] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:01,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28345961] [2025-02-06 04:10:01,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:01,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:01,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:01,302 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:10:01,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:10:01,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 04:10:01,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:10:01,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:01,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:01,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 04:10:01,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:01,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-06 04:10:01,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:10:01,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2025-02-06 04:10:01,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 04:10:01,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 04:10:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:10:02,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:10:02,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28345961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:02,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:10:02,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-02-06 04:10:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934982077] [2025-02-06 04:10:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:02,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:10:02,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:02,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:10:02,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-06 04:10:02,044 INFO L87 Difference]: Start difference. First operand 78 states and 106 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:02,375 INFO L93 Difference]: Finished difference Result 235 states and 321 transitions. [2025-02-06 04:10:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:10:02,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-02-06 04:10:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:02,377 INFO L225 Difference]: With dead ends: 235 [2025-02-06 04:10:02,378 INFO L226 Difference]: Without dead ends: 160 [2025-02-06 04:10:02,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-02-06 04:10:02,380 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 111 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:02,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 318 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 04:10:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-06 04:10:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 103. [2025-02-06 04:10:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 04:10:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 139 transitions. [2025-02-06 04:10:02,404 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 139 transitions. Word has length 62 [2025-02-06 04:10:02,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:02,404 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 139 transitions. [2025-02-06 04:10:02,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:02,404 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 139 transitions. [2025-02-06 04:10:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 04:10:02,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:02,405 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:02,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 04:10:02,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:02,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:02,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:02,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2073702643, now seen corresponding path program 1 times [2025-02-06 04:10:02,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:02,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705558034] [2025-02-06 04:10:02,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:02,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:02,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 04:10:02,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 04:10:02,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:02,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:10:03,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:03,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705558034] [2025-02-06 04:10:03,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705558034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:03,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:03,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:10:03,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720081604] [2025-02-06 04:10:03,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:03,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:10:03,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:03,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:10:03,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:10:03,083 INFO L87 Difference]: Start difference. First operand 103 states and 139 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:03,236 INFO L93 Difference]: Finished difference Result 180 states and 245 transitions. [2025-02-06 04:10:03,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:10:03,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2025-02-06 04:10:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:03,238 INFO L225 Difference]: With dead ends: 180 [2025-02-06 04:10:03,238 INFO L226 Difference]: Without dead ends: 105 [2025-02-06 04:10:03,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:10:03,239 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 124 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:03,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 243 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 04:10:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-06 04:10:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-02-06 04:10:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.315217391304348) internal successors, (121), 92 states have internal predecessors, (121), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 04:10:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2025-02-06 04:10:03,251 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 63 [2025-02-06 04:10:03,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:03,251 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2025-02-06 04:10:03,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2025-02-06 04:10:03,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 04:10:03,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:03,253 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:03,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:10:03,253 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:03,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:03,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1490960265, now seen corresponding path program 1 times [2025-02-06 04:10:03,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:03,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552315774] [2025-02-06 04:10:03,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:03,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:03,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 04:10:03,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 04:10:03,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:03,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:10:03,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:03,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552315774] [2025-02-06 04:10:03,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552315774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:03,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:03,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:10:03,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682187017] [2025-02-06 04:10:03,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:03,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:10:03,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:03,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:10:03,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:10:03,609 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 04:10:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:03,811 INFO L93 Difference]: Finished difference Result 215 states and 288 transitions. [2025-02-06 04:10:03,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:10:03,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2025-02-06 04:10:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:03,814 INFO L225 Difference]: With dead ends: 215 [2025-02-06 04:10:03,815 INFO L226 Difference]: Without dead ends: 138 [2025-02-06 04:10:03,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:10:03,816 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 160 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:03,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 226 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 04:10:03,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-06 04:10:03,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 107. [2025-02-06 04:10:03,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 94 states have internal predecessors, (123), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 04:10:03,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 143 transitions. [2025-02-06 04:10:03,831 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 143 transitions. Word has length 67 [2025-02-06 04:10:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:03,832 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 143 transitions. [2025-02-06 04:10:03,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 04:10:03,832 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 143 transitions. [2025-02-06 04:10:03,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 04:10:03,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:03,833 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:03,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 04:10:03,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:03,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:03,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1963383886, now seen corresponding path program 1 times [2025-02-06 04:10:03,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:03,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23679813] [2025-02-06 04:10:03,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:03,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:03,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 04:10:03,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 04:10:03,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:03,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:10:04,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:10:04,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23679813] [2025-02-06 04:10:04,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23679813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:04,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:04,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 04:10:04,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198841133] [2025-02-06 04:10:04,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:04,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:10:04,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:10:04,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:10:04,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:10:04,509 INFO L87 Difference]: Start difference. First operand 107 states and 143 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 04:10:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:04,854 INFO L93 Difference]: Finished difference Result 239 states and 321 transitions. [2025-02-06 04:10:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:10:04,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2025-02-06 04:10:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:04,856 INFO L225 Difference]: With dead ends: 239 [2025-02-06 04:10:04,857 INFO L226 Difference]: Without dead ends: 160 [2025-02-06 04:10:04,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:10:04,857 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 253 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:04,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 203 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 04:10:04,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-06 04:10:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 130. [2025-02-06 04:10:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 117 states have internal predecessors, (156), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 04:10:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2025-02-06 04:10:04,875 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 67 [2025-02-06 04:10:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:04,876 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2025-02-06 04:10:04,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 04:10:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2025-02-06 04:10:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 04:10:04,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:04,879 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:04,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:10:04,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:04,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1906292713, now seen corresponding path program 1 times [2025-02-06 04:10:04,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:10:04,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860604006] [2025-02-06 04:10:04,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:04,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:10:04,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 04:10:04,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 04:10:04,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:04,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 04:10:04,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763974015] [2025-02-06 04:10:04,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:04,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:04,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:04,961 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:10:04,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 04:10:05,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 04:10:05,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 04:10:05,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:05,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:10:05,198 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:10:05,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 04:10:05,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 04:10:05,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:05,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:10:05,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:10:05,394 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:10:05,395 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 04:10:05,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 04:10:05,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:10:05,599 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:05,701 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:10:05,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:10:05 BoogieIcfgContainer [2025-02-06 04:10:05,705 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:10:05,706 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:10:05,707 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:10:05,707 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:10:05,707 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:09:57" (3/4) ... [2025-02-06 04:10:05,709 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 04:10:05,710 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:10:05,711 INFO L158 Benchmark]: Toolchain (without parser) took 9065.92ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 124.4MB in the beginning and 294.2MB in the end (delta: -169.8MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2025-02-06 04:10:05,713 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:10:05,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.08ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 110.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:10:05,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.28ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 107.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:10:05,713 INFO L158 Benchmark]: Boogie Preprocessor took 80.93ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 104.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:10:05,714 INFO L158 Benchmark]: IcfgBuilder took 616.50ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 77.4MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 04:10:05,714 INFO L158 Benchmark]: TraceAbstraction took 8027.20ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 77.4MB in the beginning and 294.3MB in the end (delta: -216.9MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. [2025-02-06 04:10:05,714 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 343.9MB. Free memory was 294.3MB in the beginning and 294.2MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:10:05,715 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.27ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.08ms. Allocated memory is still 167.8MB. Free memory was 124.4MB in the beginning and 110.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.28ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 107.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.93ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 104.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 616.50ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 77.4MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8027.20ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 77.4MB in the beginning and 294.3MB in the end (delta: -216.9MB). Peak memory consumption was 140.3MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 343.9MB. Free memory was 294.3MB in the beginning and 294.2MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 104, overapproximation of shiftLeft at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L45] unsigned char* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] unsigned char* WrapperStruct0_var_1_3_Pointer = &(WrapperStruct0.var_1_3); [L47] unsigned char* WrapperStruct0_var_1_7_Pointer = &(WrapperStruct0.var_1_7); [L48] signed short int* WrapperStruct0_var_1_8_Pointer = &(WrapperStruct0.var_1_8); [L49] unsigned char* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L50] double* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L51] double* WrapperStruct0_var_1_11_Pointer = &(WrapperStruct0.var_1_11); [L52] signed short int* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L53] signed long int* WrapperStruct0_var_1_14_Pointer = &(WrapperStruct0.var_1_14); [L54] unsigned char last_1_WrapperStruct0_var_1_1 = 10; [L55] double last_1_WrapperStruct0_var_1_10 = 9.2; [L56] signed short int last_1_WrapperStruct0_var_1_12 = 1; [L57] signed long int last_1_WrapperStruct0_var_1_14 = -16; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=0, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L98] EXPR WrapperStruct0.var_1_1 [L98] last_1_WrapperStruct0_var_1_1 = WrapperStruct0.var_1_1 [L99] EXPR WrapperStruct0.var_1_10 [L99] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L100] EXPR WrapperStruct0.var_1_12 [L100] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L101] EXPR WrapperStruct0.var_1_14 [L101] last_1_WrapperStruct0_var_1_14 = WrapperStruct0.var_1_14 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L88] WrapperStruct0.var_1_3 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L89] CALL assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L89] RET assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L90] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L90] CALL assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L90] RET assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L91] WrapperStruct0.var_1_7 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L93] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L93] CALL assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L93] RET assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L94] WrapperStruct0.var_1_11 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct0.var_1_11 [L95] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F [L95] EXPR WrapperStruct0.var_1_11 [L95] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] CALL assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] RET assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L112] RET updateVariables() [L113] CALL step() [L61] unsigned char stepLocal_0 = last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10, stepLocal_0=0] [L62] COND FALSE !(((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || stepLocal_0) [L65] (*(WrapperStruct0_var_1_12_Pointer)) = last_1_WrapperStruct0_var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L67] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L67] (*(WrapperStruct0_var_1_14_Pointer)) = (*(WrapperStruct0_var_1_12_Pointer)) [L68] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L68] EXPR 10 << (*(WrapperStruct0_var_1_12_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L68] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L68] EXPR \read(*WrapperStruct0_var_1_14_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L68] COND TRUE (10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer))) [L69] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L69] (*(WrapperStruct0_var_1_8_Pointer)) = ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))) [L71] (*(WrapperStruct0_var_1_9_Pointer)) = 64 [L72] EXPR \read(*WrapperStruct0_var_1_11_Pointer) [L72] (*(WrapperStruct0_var_1_10_Pointer)) = (*(WrapperStruct0_var_1_11_Pointer)) [L73] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L73] COND TRUE (*(WrapperStruct0_var_1_12_Pointer)) <= 16 [L74] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L74] (*(WrapperStruct0_var_1_1_Pointer)) = (*(WrapperStruct0_var_1_3_Pointer)) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) [L104] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1) [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR 10 << (*(WrapperStruct0_var_1_12_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_14_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1 [L104] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L104] EXPR ((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64)) [L104] EXPR \read(*WrapperStruct0_var_1_9_Pointer) [L104] EXPR ((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer)))) [L104] EXPR \read(*WrapperStruct0_var_1_10_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_11_Pointer) [L104] EXPR (((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && ((*(WrapperStruct0_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_12_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && ((*(WrapperStruct0_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_12_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104-L105] return (((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && ((*(WrapperStruct0_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_12_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 651 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 651 mSDsluCounter, 1913 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1266 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 816 IncrementalHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 647 mSDtfsCounter, 816 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=8, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 121 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 891 NumberOfCodeBlocks, 891 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 743 ConstructedInterpolants, 0 QuantifiedInterpolants, 3615 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1174 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 436/480 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 04:10:05,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.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 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:10:07,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:10:08,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 04:10:08,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:10:08,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:10:08,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:10:08,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:10:08,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:10:08,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:10:08,075 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:10:08,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:10:08,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:10:08,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:10:08,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:10:08,076 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:10:08,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:10:08,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:10:08,077 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:10:08,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:10:08,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:10:08,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:10:08,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:10:08,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:10:08,077 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 04:10:08,077 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 04:10:08,077 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 04:10:08,077 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:10:08,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:10:08,078 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:10:08,078 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:10:08,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:10:08,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:10:08,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:10:08,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:10:08,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:10:08,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:10:08,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:10:08,078 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:10:08,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:10:08,078 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 04:10:08,079 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 04:10:08,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:10:08,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:10:08,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:10:08,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:10:08,079 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 -> 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a [2025-02-06 04:10:08,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:10:08,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:10:08,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:10:08,480 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:10:08,481 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:10:08,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2025-02-06 04:10:09,891 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c1ea5188/8949839b83884d9488162305e0c6a4cd/FLAG512236d3a [2025-02-06 04:10:10,150 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:10:10,152 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2025-02-06 04:10:10,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c1ea5188/8949839b83884d9488162305e0c6a4cd/FLAG512236d3a [2025-02-06 04:10:10,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1c1ea5188/8949839b83884d9488162305e0c6a4cd [2025-02-06 04:10:10,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:10:10,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:10:10,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:10:10,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:10:10,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:10:10,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522cb537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10, skipping insertion in model container [2025-02-06 04:10:10,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:10:10,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i[916,929] [2025-02-06 04:10:10,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:10:10,420 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:10:10,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i[916,929] [2025-02-06 04:10:10,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:10:10,493 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:10:10,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10 WrapperNode [2025-02-06 04:10:10,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:10:10,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:10:10,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:10:10,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:10:10,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,552 INFO L138 Inliner]: procedures = 36, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 334 [2025-02-06 04:10:10,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:10:10,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:10:10,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:10:10,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:10:10,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,599 INFO L175 MemorySlicer]: Split 86 memory accesses to 2 slices as follows [2, 84]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2025-02-06 04:10:10,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,622 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:10:10,633 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:10:10,633 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:10:10,633 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:10:10,638 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (1/1) ... [2025-02-06 04:10:10,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:10:10,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:10:10,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:10:10,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:10:10,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:10:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 04:10:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 04:10:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 04:10:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 04:10:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 04:10:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 04:10:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 04:10:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 04:10:10,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 04:10:10,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 04:10:10,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 04:10:10,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 04:10:10,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-02-06 04:10:10,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-02-06 04:10:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 04:10:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 04:10:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 04:10:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 04:10:10,700 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:10:10,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:10:10,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:10:10,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:10:10,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 04:10:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 04:10:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 04:10:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 04:10:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 04:10:10,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 04:10:10,810 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:10:10,812 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:10:11,346 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem44#1;havoc property_#t~ite62#1;havoc property_#t~mem46#1;havoc property_#t~mem45#1;havoc property_#t~mem47#1;havoc property_#t~mem48#1;havoc property_#t~ite51#1;havoc property_#t~mem49#1;havoc property_#t~mem50#1;havoc property_#t~mem52#1;havoc property_#t~ite61#1;havoc property_#t~mem53#1;havoc property_#t~ite58#1;havoc property_#t~mem55#1;havoc property_#t~mem54#1;havoc property_#t~mem57#1;havoc property_#t~mem56#1;havoc property_#t~mem60#1;havoc property_#t~mem59#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite69#1;havoc property_#t~mem68#1;havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~short70#1;havoc property_#t~mem71#1;havoc property_#t~short72#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~short75#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem76#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem80#1;havoc property_#t~short82#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~short85#1; [2025-02-06 04:10:11,387 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-02-06 04:10:11,387 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:10:11,401 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:10:11,401 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:10:11,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:10:11 BoogieIcfgContainer [2025-02-06 04:10:11,401 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:10:11,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:10:11,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:10:11,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:10:11,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:10:10" (1/3) ... [2025-02-06 04:10:11,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a73a703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:10:11, skipping insertion in model container [2025-02-06 04:10:11,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:10:10" (2/3) ... [2025-02-06 04:10:11,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a73a703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:10:11, skipping insertion in model container [2025-02-06 04:10:11,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:10:11" (3/3) ... [2025-02-06 04:10:11,414 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-9.i [2025-02-06 04:10:11,427 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:10:11,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-9.i that has 2 procedures, 69 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:10:11,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:10:11,518 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;@4686f598, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:10:11,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:10:11,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 04:10:11,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 04:10:11,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:11,528 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:11,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:11,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:11,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1634299074, now seen corresponding path program 1 times [2025-02-06 04:10:11,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:10:11,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072150434] [2025-02-06 04:10:11,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:11,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:10:11,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:10:11,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:10:11,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 04:10:11,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 04:10:11,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 04:10:11,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:11,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:11,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:10:11,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-06 04:10:11,834 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:10:11,835 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:10:11,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072150434] [2025-02-06 04:10:11,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072150434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:11,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:11,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:10:11,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372190141] [2025-02-06 04:10:11,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:11,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:10:11,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:10:11,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:10:11,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:10:11,858 INFO L87 Difference]: Start difference. First operand has 69 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:11,874 INFO L93 Difference]: Finished difference Result 132 states and 194 transitions. [2025-02-06 04:10:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:10:11,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-02-06 04:10:11,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:11,880 INFO L225 Difference]: With dead ends: 132 [2025-02-06 04:10:11,880 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 04:10:11,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:10:11,886 INFO L435 NwaCegarLoop]: 92 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, 92 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:11,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:10:11,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 04:10:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-02-06 04:10:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 04:10:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2025-02-06 04:10:11,921 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 60 [2025-02-06 04:10:11,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:11,922 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2025-02-06 04:10:11,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2025-02-06 04:10:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 04:10:11,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:11,924 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:11,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 04:10:12,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:10:12,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:12,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:12,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1500545637, now seen corresponding path program 1 times [2025-02-06 04:10:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:10:12,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61437747] [2025-02-06 04:10:12,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:12,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:10:12,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:10:12,130 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:10:12,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 04:10:12,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 04:10:12,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 04:10:12,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:12,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:12,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:10:12,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:10:12,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:10:12,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:10:12,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61437747] [2025-02-06 04:10:12,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61437747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:12,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:12,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:10:12,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681890385] [2025-02-06 04:10:12,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:12,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:10:12,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:10:12,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:10:12,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:10:12,417 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:12,463 INFO L93 Difference]: Finished difference Result 132 states and 185 transitions. [2025-02-06 04:10:12,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:10:12,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-02-06 04:10:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:12,464 INFO L225 Difference]: With dead ends: 132 [2025-02-06 04:10:12,464 INFO L226 Difference]: Without dead ends: 69 [2025-02-06 04:10:12,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:10:12,467 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:12,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 256 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:10:12,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-06 04:10:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-02-06 04:10:12,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 04:10:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2025-02-06 04:10:12,479 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 60 [2025-02-06 04:10:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:12,480 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2025-02-06 04:10:12,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2025-02-06 04:10:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 04:10:12,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:12,482 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:12,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:10:12,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:10:12,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:12,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:12,688 INFO L85 PathProgramCache]: Analyzing trace with hash -296405722, now seen corresponding path program 1 times [2025-02-06 04:10:12,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:10:12,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391310824] [2025-02-06 04:10:12,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:12,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:10:12,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:10:12,691 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:10:12,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 04:10:12,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 04:10:12,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 04:10:12,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:12,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:12,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 04:10:12,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:10:12,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:10:12,973 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:10:12,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391310824] [2025-02-06 04:10:12,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391310824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:12,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:12,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:10:12,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547460388] [2025-02-06 04:10:12,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:12,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:10:12,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:10:12,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:10:12,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:10:12,975 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:13,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:13,031 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2025-02-06 04:10:13,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:10:13,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-02-06 04:10:13,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:13,036 INFO L225 Difference]: With dead ends: 136 [2025-02-06 04:10:13,036 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 04:10:13,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 04:10:13,037 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:13,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 333 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:10:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 04:10:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-02-06 04:10:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 04:10:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2025-02-06 04:10:13,048 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 60 [2025-02-06 04:10:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:13,049 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2025-02-06 04:10:13,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2025-02-06 04:10:13,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 04:10:13,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:13,051 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:13,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 04:10:13,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:10:13,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:13,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:13,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2103860185, now seen corresponding path program 1 times [2025-02-06 04:10:13,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:10:13,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499221516] [2025-02-06 04:10:13,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:13,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:10:13,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:10:13,259 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:10:13,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 04:10:13,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 04:10:13,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 04:10:13,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:13,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:13,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:10:13,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:10:13,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:10:13,483 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:10:13,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499221516] [2025-02-06 04:10:13,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499221516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:13,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:10:13,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 04:10:13,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732659136] [2025-02-06 04:10:13,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:13,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:10:13,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:10:13,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:10:13,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:10:13,484 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:13,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:13,553 INFO L93 Difference]: Finished difference Result 142 states and 196 transitions. [2025-02-06 04:10:13,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:10:13,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-02-06 04:10:13,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:13,555 INFO L225 Difference]: With dead ends: 142 [2025-02-06 04:10:13,555 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 04:10:13,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:10:13,556 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:13,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 04:10:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 04:10:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-02-06 04:10:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 04:10:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2025-02-06 04:10:13,566 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 60 [2025-02-06 04:10:13,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:13,567 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2025-02-06 04:10:13,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:13,567 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2025-02-06 04:10:13,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 04:10:13,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:13,568 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:13,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 04:10:13,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:10:13,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:13,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:13,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2102936664, now seen corresponding path program 1 times [2025-02-06 04:10:13,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:10:13,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584661525] [2025-02-06 04:10:13,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:13,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:10:13,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:10:13,779 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:10:13,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 04:10:13,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 04:10:14,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 04:10:14,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:14,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:14,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 04:10:14,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:14,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 04:10:14,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 04:10:15,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 04:10:16,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-02-06 04:10:21,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2025-02-06 04:10:25,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2025-02-06 04:10:26,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 78 [2025-02-06 04:10:26,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 90 [2025-02-06 04:10:26,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:10:26,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 124 treesize of output 68 [2025-02-06 04:10:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 04:10:26,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:10:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:10:26,875 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:10:26,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584661525] [2025-02-06 04:10:26,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584661525] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:26,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:10:26,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2025-02-06 04:10:26,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605523191] [2025-02-06 04:10:26,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:26,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:10:26,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:10:26,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:10:26,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=174, Unknown=4, NotChecked=0, Total=210 [2025-02-06 04:10:26,877 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:27,281 INFO L93 Difference]: Finished difference Result 149 states and 202 transitions. [2025-02-06 04:10:27,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:10:27,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2025-02-06 04:10:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:27,283 INFO L225 Difference]: With dead ends: 149 [2025-02-06 04:10:27,283 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 04:10:27,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=40, Invalid=228, Unknown=4, NotChecked=0, Total=272 [2025-02-06 04:10:27,284 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 44 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:27,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 235 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 04:10:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 04:10:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2025-02-06 04:10:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 69 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-06 04:10:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2025-02-06 04:10:27,290 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 60 [2025-02-06 04:10:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:27,290 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2025-02-06 04:10:27,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2025-02-06 04:10:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 04:10:27,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:27,291 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:27,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-02-06 04:10:27,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:10:27,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:27,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:27,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1925502556, now seen corresponding path program 1 times [2025-02-06 04:10:27,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:10:27,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976516011] [2025-02-06 04:10:27,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:27,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:10:27,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:10:27,499 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:10:27,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 04:10:27,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 04:10:27,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:10:27,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:27,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:27,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 04:10:27,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:28,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2025-02-06 04:10:29,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2025-02-06 04:10:29,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 38 [2025-02-06 04:10:30,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2025-02-06 04:10:30,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2025-02-06 04:10:30,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 21 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 75 [2025-02-06 04:10:30,869 INFO L349 Elim1Store]: treesize reduction 103, result has 12.7 percent of original size [2025-02-06 04:10:30,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 89 treesize of output 113 [2025-02-06 04:10:31,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:10:31,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 128 treesize of output 72 [2025-02-06 04:10:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 04:10:31,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:10:39,625 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:10:39,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976516011] [2025-02-06 04:10:39,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1976516011] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:10:39,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1138453148] [2025-02-06 04:10:39,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:39,625 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 04:10:39,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 04:10:39,627 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 04:10:39,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-02-06 04:10:39,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 04:10:40,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:10:40,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:40,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:40,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 04:10:40,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:40,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 04:10:43,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-02-06 04:10:44,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2025-02-06 04:10:44,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 53 [2025-02-06 04:10:45,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2025-02-06 04:10:45,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 50 [2025-02-06 04:10:46,220 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-06 04:10:46,221 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:10:46,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1138453148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:10:46,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:10:46,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2025-02-06 04:10:46,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253034621] [2025-02-06 04:10:46,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:10:46,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:10:46,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:10:46,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:10:46,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2025-02-06 04:10:46,222 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:50,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:10:50,954 INFO L93 Difference]: Finished difference Result 273 states and 368 transitions. [2025-02-06 04:10:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 04:10:50,955 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2025-02-06 04:10:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:10:50,956 INFO L225 Difference]: With dead ends: 273 [2025-02-06 04:10:50,956 INFO L226 Difference]: Without dead ends: 200 [2025-02-06 04:10:50,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2025-02-06 04:10:50,957 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 320 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:10:50,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 347 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-06 04:10:50,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-06 04:10:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 145. [2025-02-06 04:10:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 132 states have (on average 1.3333333333333333) internal successors, (176), 132 states have internal predecessors, (176), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 04:10:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 196 transitions. [2025-02-06 04:10:50,979 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 196 transitions. Word has length 62 [2025-02-06 04:10:50,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:10:50,980 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 196 transitions. [2025-02-06 04:10:50,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 04:10:50,980 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 196 transitions. [2025-02-06 04:10:50,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-06 04:10:50,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:10:50,981 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:10:50,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-06 04:10:51,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-02-06 04:10:51,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-06 04:10:51,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:10:51,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:10:51,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1863906115, now seen corresponding path program 1 times [2025-02-06 04:10:51,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:10:51,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060317350] [2025-02-06 04:10:51,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:10:51,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:10:51,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:10:51,387 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:10:51,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-02-06 04:10:51,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 04:10:51,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 04:10:51,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:10:51,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:10:51,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 04:10:51,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:10:54,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2025-02-06 04:10:55,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 59 [2025-02-06 04:10:55,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 75 [2025-02-06 04:10:55,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 21 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 123 [2025-02-06 04:10:56,346 INFO L349 Elim1Store]: treesize reduction 103, result has 12.7 percent of original size [2025-02-06 04:10:56,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 8 case distinctions, treesize of input 169 treesize of output 165 [2025-02-06 04:10:57,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:10:57,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 318 treesize of output 158 [2025-02-06 04:10:57,429 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 04:10:57,429 INFO L312 TraceCheckSpWp]: Computing backward predicates...