./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.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 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:58:58,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:58:58,304 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:58:58,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:58:58,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:58:58,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:58:58,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:58:58,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:58:58,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:58:58,332 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:58:58,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:58:58,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:58:58,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:58:58,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:58:58,334 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:58:58,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:58:58,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:58:58,334 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:58:58,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:58:58,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:58:58,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:58:58,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:58:58,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:58:58,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:58:58,335 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:58:58,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:58:58,335 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:58:58,335 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:58:58,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:58:58,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:58:58,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:58:58,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:58:58,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:58:58,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:58:58,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:58:58,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:58:58,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:58:58,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:58:58,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:58:58,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:58:58,336 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:58:58,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:58:58,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:58:58,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:58:58,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:58:58,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:58:58,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:58:58,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:58:58,337 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 -> 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 [2025-01-09 15:58:58,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:58:58,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:58:58,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:58:58,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:58:58,568 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:58:58,569 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-s_file-47.i [2025-01-09 15:58:59,690 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf60a1805/cf68f77de77341ab8136d2b94cbcfee1/FLAG7f0991395 [2025-01-09 15:58:59,926 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:58:59,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i [2025-01-09 15:58:59,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf60a1805/cf68f77de77341ab8136d2b94cbcfee1/FLAG7f0991395 [2025-01-09 15:58:59,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf60a1805/cf68f77de77341ab8136d2b94cbcfee1 [2025-01-09 15:58:59,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:58:59,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:58:59,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:58:59,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:58:59,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:58:59,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:58:59" (1/1) ... [2025-01-09 15:58:59,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@369609db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:58:59, skipping insertion in model container [2025-01-09 15:58:59,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:58:59" (1/1) ... [2025-01-09 15:58:59,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:59:00,072 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-s_file-47.i[916,929] [2025-01-09 15:59:00,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:59:00,131 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:59:00,140 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-s_file-47.i[916,929] [2025-01-09 15:59:00,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:59:00,193 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:59:00,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:00 WrapperNode [2025-01-09 15:59:00,196 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:59:00,197 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:59:00,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:59:00,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:59:00,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:00" (1/1) ... [2025-01-09 15:59:00,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:00" (1/1) ... [2025-01-09 15:59:00,240 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 448 [2025-01-09 15:59:00,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:59:00,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:59:00,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:59:00,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:59:00,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:00" (1/1) ... [2025-01-09 15:59:00,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:00" (1/1) ... [2025-01-09 15:59:00,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:00" (1/1) ... [2025-01-09 15:59:00,272 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2025-01-09 15:59:00,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:00" (1/1) ... [2025-01-09 15:59:00,272 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:00" (1/1) ... [2025-01-09 15:59:00,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:00" (1/1) ... [2025-01-09 15:59:00,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:00" (1/1) ... [2025-01-09 15:59:00,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:00" (1/1) ... [2025-01-09 15:59:00,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:00" (1/1) ... [2025-01-09 15:59:00,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:00" (1/1) ... [2025-01-09 15:59:00,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:59:00,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:59:00,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:59:00,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:59:00,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:00" (1/1) ... [2025-01-09 15:59:00,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:00,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:59:00,320 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:59:00,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:59:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:59:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:59:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:59:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:59:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:59:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:59:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:59:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:59:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:59:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:59:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:59:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:59:00,336 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:59:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:59:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:59:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:59:00,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:59:00,414 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:59:00,416 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:59:00,685 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2025-01-09 15:59:00,685 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:59:00,693 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:59:00,694 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:59:00,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:00 BoogieIcfgContainer [2025-01-09 15:59:00,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:59:00,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:59:00,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:59:00,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:59:00,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:58:59" (1/3) ... [2025-01-09 15:59:00,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177b07b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:59:00, skipping insertion in model container [2025-01-09 15:59:00,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:00" (2/3) ... [2025-01-09 15:59:00,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177b07b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:59:00, skipping insertion in model container [2025-01-09 15:59:00,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:00" (3/3) ... [2025-01-09 15:59:00,701 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-47.i [2025-01-09 15:59:00,713 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:59:00,714 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-47.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:59:00,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:59:00,766 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;@359e3241, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:59:00,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:59:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:59:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 15:59:00,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:00,777 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:00,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:00,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:00,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1637333938, now seen corresponding path program 1 times [2025-01-09 15:59:00,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:00,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453239865] [2025-01-09 15:59:00,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:00,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:00,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:00,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:00,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:00,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 15:59:00,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:00,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453239865] [2025-01-09 15:59:00,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453239865] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:59:00,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980344604] [2025-01-09 15:59:00,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:00,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:59:00,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:59:00,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:59:00,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:59:01,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:01,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:01,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:01,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:01,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:59:01,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 15:59:01,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:01,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980344604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:01,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:59:01,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:59:01,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596264101] [2025-01-09 15:59:01,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:01,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:59:01,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:01,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:59:01,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:59:01,178 INFO L87 Difference]: Start difference. First operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:59:01,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:01,197 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-01-09 15:59:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:59:01,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-01-09 15:59:01,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:01,202 INFO L225 Difference]: With dead ends: 184 [2025-01-09 15:59:01,202 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 15:59:01,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:59:01,205 INFO L435 NwaCegarLoop]: 134 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, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:01,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:59:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 15:59:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 15:59:01,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:59:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-01-09 15:59:01,229 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2025-01-09 15:59:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:01,229 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-01-09 15:59:01,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:59:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-01-09 15:59:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 15:59:01,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:01,231 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:01,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:59:01,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:59:01,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:01,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:01,435 INFO L85 PathProgramCache]: Analyzing trace with hash 975415776, now seen corresponding path program 1 times [2025-01-09 15:59:01,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:01,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472390225] [2025-01-09 15:59:01,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:01,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:01,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:01,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:01,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:01,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:01,616 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:59:01,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:01,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472390225] [2025-01-09 15:59:01,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472390225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:01,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:01,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:59:01,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331536785] [2025-01-09 15:59:01,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:01,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:59:01,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:01,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:59:01,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:59:01,620 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:01,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:01,645 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2025-01-09 15:59:01,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:59:01,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-01-09 15:59:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:01,648 INFO L225 Difference]: With dead ends: 182 [2025-01-09 15:59:01,649 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 15:59:01,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:59:01,650 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:01,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:59:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 15:59:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 15:59:01,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:59:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-01-09 15:59:01,662 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2025-01-09 15:59:01,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:01,663 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-01-09 15:59:01,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-01-09 15:59:01,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 15:59:01,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:01,667 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:01,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:59:01,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:01,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash -713527966, now seen corresponding path program 1 times [2025-01-09 15:59:01,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:01,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700904119] [2025-01-09 15:59:01,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:01,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:01,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:01,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:01,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:01,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:01,918 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 15:59:01,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:01,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700904119] [2025-01-09 15:59:01,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700904119] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:59:01,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502353736] [2025-01-09 15:59:01,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:01,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:59:01,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:59:01,922 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:59:01,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:59:02,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:02,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:02,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:02,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:02,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:59:02,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:59:02,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:02,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502353736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:02,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:59:02,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 15:59:02,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387385882] [2025-01-09 15:59:02,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:02,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:59:02,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:02,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:59:02,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:59:02,093 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:02,127 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2025-01-09 15:59:02,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:59:02,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-01-09 15:59:02,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:02,132 INFO L225 Difference]: With dead ends: 186 [2025-01-09 15:59:02,132 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 15:59:02,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:59:02,133 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:02,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:59:02,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 15:59:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-01-09 15:59:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:59:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2025-01-09 15:59:02,138 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 84 [2025-01-09 15:59:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:02,139 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2025-01-09 15:59:02,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2025-01-09 15:59:02,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 15:59:02,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:02,140 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:02,146 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-01-09 15:59:02,344 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-01-09 15:59:02,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:02,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:02,344 INFO L85 PathProgramCache]: Analyzing trace with hash -711680924, now seen corresponding path program 1 times [2025-01-09 15:59:02,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:02,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713472906] [2025-01-09 15:59:02,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:02,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:02,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:02,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:02,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:02,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-01-09 15:59:02,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:59:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713472906] [2025-01-09 15:59:02,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713472906] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:59:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219163542] [2025-01-09 15:59:02,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:02,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:59:02,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:59:02,504 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-01-09 15:59:02,506 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-01-09 15:59:02,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:02,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:02,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:02,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:02,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:59:02,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:02,646 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:59:02,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:02,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219163542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:02,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:59:02,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-01-09 15:59:02,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077694334] [2025-01-09 15:59:02,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:02,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:59:02,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:59:02,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:59:02,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:59:02,648 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:02,677 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2025-01-09 15:59:02,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:59:02,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-01-09 15:59:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:02,679 INFO L225 Difference]: With dead ends: 190 [2025-01-09 15:59:02,679 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 15:59:02,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:59:02,680 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:02,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:59:02,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 15:59:02,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 15:59:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 87 states have internal predecessors, (122), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:59:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-01-09 15:59:02,689 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 84 [2025-01-09 15:59:02,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:02,689 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-01-09 15:59:02,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-01-09 15:59:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 15:59:02,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:02,692 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:02,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:59:02,892 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-01-09 15:59:02,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:02,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:02,893 INFO L85 PathProgramCache]: Analyzing trace with hash 799724246, now seen corresponding path program 1 times [2025-01-09 15:59:02,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:59:02,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793593620] [2025-01-09 15:59:02,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:02,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:59:02,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:02,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:02,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:02,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:59:02,947 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:59:02,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:02,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:02,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:02,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:59:03,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:59:03,019 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:59:03,019 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:59:03,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:59:03,023 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 15:59:03,064 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:59:03,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:59:03 BoogieIcfgContainer [2025-01-09 15:59:03,068 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:59:03,069 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:59:03,069 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:59:03,069 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:59:03,070 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:00" (3/4) ... [2025-01-09 15:59:03,071 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:59:03,072 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:59:03,073 INFO L158 Benchmark]: Toolchain (without parser) took 3120.25ms. Allocated memory is still 201.3MB. Free memory was 155.6MB in the beginning and 94.6MB in the end (delta: 60.9MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2025-01-09 15:59:03,074 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:59:03,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.99ms. Allocated memory is still 201.3MB. Free memory was 155.2MB in the beginning and 140.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:59:03,075 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.78ms. Allocated memory is still 201.3MB. Free memory was 140.7MB in the beginning and 137.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:59:03,075 INFO L158 Benchmark]: Boogie Preprocessor took 55.35ms. Allocated memory is still 201.3MB. Free memory was 137.6MB in the beginning and 134.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:59:03,075 INFO L158 Benchmark]: RCFGBuilder took 397.71ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 106.5MB in the end (delta: 27.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:59:03,075 INFO L158 Benchmark]: TraceAbstraction took 2372.27ms. Allocated memory is still 201.3MB. Free memory was 106.1MB in the beginning and 95.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2025-01-09 15:59:03,075 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 201.3MB. Free memory was 95.9MB in the beginning and 94.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:59:03,076 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.20ms. Allocated memory is still 201.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.99ms. Allocated memory is still 201.3MB. Free memory was 155.2MB in the beginning and 140.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.78ms. Allocated memory is still 201.3MB. Free memory was 140.7MB in the beginning and 137.6MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.35ms. Allocated memory is still 201.3MB. Free memory was 137.6MB in the beginning and 134.2MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 397.71ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 106.5MB in the end (delta: 27.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2372.27ms. Allocated memory is still 201.3MB. Free memory was 106.1MB in the beginning and 95.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 201.3MB. Free memory was 95.9MB in the beginning and 94.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 65. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L45] signed long int last_1_WrapperStruct0_var_1_12 = 8; VAL [WrapperStruct0={4:0}, isInitial=0, last_1_WrapperStruct0_var_1_12=8] [L99] isInitial = 1 [L100] FCALL initially() [L102] CALL updateLastVariables() [L92] EXPR WrapperStruct0.var_1_12 [L92] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L102] RET updateLastVariables() [L103] CALL updateVariables() [L76] WrapperStruct0.var_1_8 = __VERIFIER_nondet_double() [L77] EXPR WrapperStruct0.var_1_8 [L77] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F [L77] EXPR WrapperStruct0.var_1_8 [L77] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] CALL assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] RET assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L78] WrapperStruct0.var_1_10 = __VERIFIER_nondet_char() [L79] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L79] CALL assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L79] RET assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L80] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L80] CALL assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L80] RET assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L81] WrapperStruct0.var_1_11 = __VERIFIER_nondet_char() [L82] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L82] CALL assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L82] RET assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L83] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L83] CALL assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L83] RET assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L84] WrapperStruct0.var_1_13 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L85] CALL assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L85] RET assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] CALL assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] RET assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L87] WrapperStruct0.var_1_14 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] CALL assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] RET assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] CALL assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] RET assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L103] RET updateVariables() [L104] CALL step() [L49] COND FALSE !(-4 > last_1_WrapperStruct0_var_1_12) [L54] EXPR WrapperStruct0.var_1_10 [L54] WrapperStruct0.var_1_9 = WrapperStruct0.var_1_10 [L56] EXPR WrapperStruct0.var_1_13 [L56] unsigned char stepLocal_0 = ! WrapperStruct0.var_1_13; [L57] stepLocal_0 || WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L57] stepLocal_0 || WrapperStruct0.var_1_14 [L57] EXPR WrapperStruct0.var_1_14 [L57] stepLocal_0 || WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L57] COND FALSE !(stepLocal_0 || WrapperStruct0.var_1_14) [L64] EXPR WrapperStruct0.var_1_8 [L64] WrapperStruct0.var_1_15 = WrapperStruct0.var_1_8 [L65] EXPR WrapperStruct0.var_1_15 [L65] EXPR WrapperStruct0.var_1_15 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L65] COND FALSE !(WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) [L70] EXPR WrapperStruct0.var_1_12 [L70] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L70] COND TRUE WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9 [L71] EXPR WrapperStruct0.var_1_8 [L71] WrapperStruct0.var_1_1 = WrapperStruct0.var_1_8 [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR WrapperStruct0.var_1_15 [L95] EXPR WrapperStruct0.var_1_15 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1) [L95] EXPR WrapperStruct0.var_1_12 [L95] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1 [L95] EXPR WrapperStruct0.var_1_1 [L95] EXPR WrapperStruct0.var_1_8 [L95] EXPR (WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1)) && (WrapperStruct0.var_1_15 == ((double) WrapperStruct0.var_1_8)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1)) && (WrapperStruct0.var_1_15 == ((double) WrapperStruct0.var_1_8)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95-L96] return ((((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1)) && (WrapperStruct0.var_1_15 == ((double) WrapperStruct0.var_1_8)) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L19] reach_error() VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 758 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 529 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=4, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 672 NumberOfCodeBlocks, 672 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 581 ConstructedInterpolants, 0 QuantifiedInterpolants, 615 SizeOfPredicates, 0 NumberOfNonLiveVariables, 863 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 974/1008 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:59:03,093 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-s_file-47.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 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:59:04,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:59:05,082 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:59:05,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:59:05,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:59:05,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:59:05,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:59:05,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:59:05,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:59:05,119 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:59:05,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:59:05,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:59:05,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:59:05,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:59:05,120 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:59:05,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:59:05,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:59:05,121 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:59:05,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:59:05,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:59:05,121 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:59:05,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:59:05,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:59:05,121 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:59:05,121 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:59:05,121 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:59:05,121 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:59:05,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:59:05,122 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:05,122 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:05,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:59:05,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:59:05,123 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 -> 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 [2025-01-09 15:59:05,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:59:05,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:59:05,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:59:05,388 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:59:05,388 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:59:05,389 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-s_file-47.i [2025-01-09 15:59:06,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37284f5db/09f3552e9625432bba9dbc0ccbe47118/FLAG0e965c305 [2025-01-09 15:59:06,770 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:59:06,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i [2025-01-09 15:59:06,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37284f5db/09f3552e9625432bba9dbc0ccbe47118/FLAG0e965c305 [2025-01-09 15:59:06,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37284f5db/09f3552e9625432bba9dbc0ccbe47118 [2025-01-09 15:59:06,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:59:06,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:59:06,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:59:06,797 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:59:06,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:59:06,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:59:06" (1/1) ... [2025-01-09 15:59:06,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ef37a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:06, skipping insertion in model container [2025-01-09 15:59:06,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:59:06" (1/1) ... [2025-01-09 15:59:06,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:59:06,916 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-s_file-47.i[916,929] [2025-01-09 15:59:06,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:59:06,971 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:59:06,980 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-s_file-47.i[916,929] [2025-01-09 15:59:07,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:59:07,024 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:59:07,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:07 WrapperNode [2025-01-09 15:59:07,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:59:07,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:59:07,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:59:07,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:59:07,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:07" (1/1) ... [2025-01-09 15:59:07,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:07" (1/1) ... [2025-01-09 15:59:07,084 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 446 [2025-01-09 15:59:07,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:59:07,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:59:07,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:59:07,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:59:07,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:07" (1/1) ... [2025-01-09 15:59:07,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:07" (1/1) ... [2025-01-09 15:59:07,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:07" (1/1) ... [2025-01-09 15:59:07,126 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2025-01-09 15:59:07,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:07" (1/1) ... [2025-01-09 15:59:07,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:07" (1/1) ... [2025-01-09 15:59:07,154 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:07" (1/1) ... [2025-01-09 15:59:07,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:07" (1/1) ... [2025-01-09 15:59:07,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:07" (1/1) ... [2025-01-09 15:59:07,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:07" (1/1) ... [2025-01-09 15:59:07,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:07" (1/1) ... [2025-01-09 15:59:07,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:59:07,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:59:07,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:59:07,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:59:07,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:07" (1/1) ... [2025-01-09 15:59:07,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:59:07,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:59:07,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:59:07,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:59:07,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 15:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 15:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:59:07,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:59:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:59:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:59:07,215 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:59:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:59:07,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:59:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:59:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:59:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:59:07,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:59:07,298 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:59:07,299 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:59:07,696 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2025-01-09 15:59:07,697 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:59:07,705 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:59:07,706 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:59:07,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:07 BoogieIcfgContainer [2025-01-09 15:59:07,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:59:07,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:59:07,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:59:07,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:59:07,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:59:06" (1/3) ... [2025-01-09 15:59:07,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb9e255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:59:07, skipping insertion in model container [2025-01-09 15:59:07,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:07" (2/3) ... [2025-01-09 15:59:07,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb9e255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:59:07, skipping insertion in model container [2025-01-09 15:59:07,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:07" (3/3) ... [2025-01-09 15:59:07,715 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-47.i [2025-01-09 15:59:07,727 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:59:07,728 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-47.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:59:07,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:59:07,775 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;@1b4ab760, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:59:07,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:59:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:59:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 15:59:07,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:07,787 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:07,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:07,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:07,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1637333938, now seen corresponding path program 1 times [2025-01-09 15:59:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:07,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710497405] [2025-01-09 15:59:07,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:07,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:07,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:07,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:07,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:59:07,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:08,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:08,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:08,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:08,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:59:08,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 15:59:08,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:08,044 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:08,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710497405] [2025-01-09 15:59:08,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710497405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:08,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:08,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:59:08,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539033694] [2025-01-09 15:59:08,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:08,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:59:08,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:08,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:59:08,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:59:08,060 INFO L87 Difference]: Start difference. First operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:59:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:08,080 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-01-09 15:59:08,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:59:08,082 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-01-09 15:59:08,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:08,086 INFO L225 Difference]: With dead ends: 184 [2025-01-09 15:59:08,087 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 15:59:08,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:59:08,091 INFO L435 NwaCegarLoop]: 134 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, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:08,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:59:08,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 15:59:08,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-01-09 15:59:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:59:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-01-09 15:59:08,126 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2025-01-09 15:59:08,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:08,127 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-01-09 15:59:08,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:59:08,127 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-01-09 15:59:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 15:59:08,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:08,130 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:08,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:59:08,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:08,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:08,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:08,332 INFO L85 PathProgramCache]: Analyzing trace with hash 975415776, now seen corresponding path program 1 times [2025-01-09 15:59:08,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:08,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591687129] [2025-01-09 15:59:08,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:08,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:08,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:08,335 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:08,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:59:08,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:08,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:08,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:08,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:08,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 15:59:08,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:59:08,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:08,537 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:08,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591687129] [2025-01-09 15:59:08,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591687129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:08,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:08,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:59:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658524218] [2025-01-09 15:59:08,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:08,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:59:08,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:08,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:59:08,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:59:08,540 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:08,570 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2025-01-09 15:59:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:59:08,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-01-09 15:59:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:08,572 INFO L225 Difference]: With dead ends: 182 [2025-01-09 15:59:08,573 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 15:59:08,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:59:08,574 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:08,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:59:08,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 15:59:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 15:59:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:59:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-01-09 15:59:08,588 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 84 [2025-01-09 15:59:08,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:08,589 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-01-09 15:59:08,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-01-09 15:59:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 15:59:08,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:08,590 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:08,598 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-01-09 15:59:08,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:08,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:08,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:08,792 INFO L85 PathProgramCache]: Analyzing trace with hash -713527966, now seen corresponding path program 1 times [2025-01-09 15:59:08,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:08,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007128210] [2025-01-09 15:59:08,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:08,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:08,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:08,794 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:08,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 15:59:08,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:08,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:08,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:08,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:08,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:59:08,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:59:09,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:09,004 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:09,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007128210] [2025-01-09 15:59:09,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007128210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:09,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:09,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:59:09,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813207887] [2025-01-09 15:59:09,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:09,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:59:09,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:09,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:59:09,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:59:09,006 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:09,062 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2025-01-09 15:59:09,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:59:09,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-01-09 15:59:09,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:09,063 INFO L225 Difference]: With dead ends: 186 [2025-01-09 15:59:09,063 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 15:59:09,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-01-09 15:59:09,064 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:09,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:59:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 15:59:09,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-09 15:59:09,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:59:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-01-09 15:59:09,069 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 84 [2025-01-09 15:59:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:09,070 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-01-09 15:59:09,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-01-09 15:59:09,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 15:59:09,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:09,071 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:09,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 15:59:09,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:09,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:09,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:09,272 INFO L85 PathProgramCache]: Analyzing trace with hash 797877204, now seen corresponding path program 1 times [2025-01-09 15:59:09,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:09,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666964146] [2025-01-09 15:59:09,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:09,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:09,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:09,274 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:09,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 15:59:09,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:09,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:09,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:09,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:09,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:59:09,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:09,463 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:59:09,463 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:09,463 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:09,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666964146] [2025-01-09 15:59:09,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666964146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:09,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:09,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:59:09,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070477825] [2025-01-09 15:59:09,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:09,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:59:09,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:09,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:59:09,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:59:09,465 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:09,505 INFO L93 Difference]: Finished difference Result 194 states and 280 transitions. [2025-01-09 15:59:09,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:59:09,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-01-09 15:59:09,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:09,506 INFO L225 Difference]: With dead ends: 194 [2025-01-09 15:59:09,508 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 15:59:09,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-01-09 15:59:09,509 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:09,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:59:09,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 15:59:09,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-01-09 15:59:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:59:09,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2025-01-09 15:59:09,519 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 84 [2025-01-09 15:59:09,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:09,519 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2025-01-09 15:59:09,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:09,519 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2025-01-09 15:59:09,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 15:59:09,520 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:09,520 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:09,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 15:59:09,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:09,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:09,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:09,721 INFO L85 PathProgramCache]: Analyzing trace with hash 799724246, now seen corresponding path program 1 times [2025-01-09 15:59:09,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:09,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91351375] [2025-01-09 15:59:09,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:09,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:09,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:09,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:09,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 15:59:09,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:09,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:09,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:09,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:09,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 15:59:10,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:10,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:59:10,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:10,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 69 [2025-01-09 15:59:10,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:10,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 82 [2025-01-09 15:59:10,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:10,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 147 treesize of output 95 [2025-01-09 15:59:11,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:11,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 162 treesize of output 98 [2025-01-09 15:59:11,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:11,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 164 treesize of output 109 [2025-01-09 15:59:11,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:11,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 217 treesize of output 79 [2025-01-09 15:59:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 15:59:11,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:11,821 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:11,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91351375] [2025-01-09 15:59:11,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91351375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:11,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:11,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:59:11,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580026476] [2025-01-09 15:59:11,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:11,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:59:11,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:11,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:59:11,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:59:11,823 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 15:59:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:13,777 INFO L93 Difference]: Finished difference Result 366 states and 513 transitions. [2025-01-09 15:59:13,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:59:13,777 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 84 [2025-01-09 15:59:13,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:13,779 INFO L225 Difference]: With dead ends: 366 [2025-01-09 15:59:13,779 INFO L226 Difference]: Without dead ends: 269 [2025-01-09 15:59:13,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:59:13,779 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 633 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:13,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 451 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 15:59:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-01-09 15:59:13,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 155. [2025-01-09 15:59:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 131 states have (on average 1.3511450381679388) internal successors, (177), 131 states have internal predecessors, (177), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:59:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 213 transitions. [2025-01-09 15:59:13,791 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 213 transitions. Word has length 84 [2025-01-09 15:59:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:13,791 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 213 transitions. [2025-01-09 15:59:13,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 15:59:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 213 transitions. [2025-01-09 15:59:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 15:59:13,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:13,793 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:13,801 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 (6)] Ended with exit code 0 [2025-01-09 15:59:13,993 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-01-09 15:59:13,993 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:13,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:13,994 INFO L85 PathProgramCache]: Analyzing trace with hash -587573953, now seen corresponding path program 1 times [2025-01-09 15:59:13,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:13,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503300307] [2025-01-09 15:59:13,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:13,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:13,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:13,997 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:13,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 15:59:14,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:14,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:14,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:14,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:14,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:59:14,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:14,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:14,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 46 [2025-01-09 15:59:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:59:14,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:14,289 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:14,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503300307] [2025-01-09 15:59:14,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503300307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:14,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:14,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:59:14,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142458498] [2025-01-09 15:59:14,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:14,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:59:14,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:14,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:59:14,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:59:14,290 INFO L87 Difference]: Start difference. First operand 155 states and 213 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:18,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:59:20,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:20,143 INFO L93 Difference]: Finished difference Result 352 states and 484 transitions. [2025-01-09 15:59:20,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:59:20,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-01-09 15:59:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:20,146 INFO L225 Difference]: With dead ends: 352 [2025-01-09 15:59:20,146 INFO L226 Difference]: Without dead ends: 200 [2025-01-09 15:59:20,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:59:20,147 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 57 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:20,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 335 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-01-09 15:59:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-09 15:59:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 157. [2025-01-09 15:59:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 133 states have (on average 1.3458646616541354) internal successors, (179), 133 states have internal predecessors, (179), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:59:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 215 transitions. [2025-01-09 15:59:20,165 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 215 transitions. Word has length 84 [2025-01-09 15:59:20,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:20,165 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 215 transitions. [2025-01-09 15:59:20,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 215 transitions. [2025-01-09 15:59:20,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-01-09 15:59:20,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:20,167 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:20,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-01-09 15:59:20,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:20,371 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:20,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:20,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1039963992, now seen corresponding path program 1 times [2025-01-09 15:59:20,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:20,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507524121] [2025-01-09 15:59:20,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:20,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:20,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:20,374 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:20,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 15:59:20,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 15:59:20,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 15:59:20,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:20,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:20,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:59:20,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:59:20,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:20,520 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507524121] [2025-01-09 15:59:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507524121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:20,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:20,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:59:20,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588627876] [2025-01-09 15:59:20,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:20,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:59:20,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:20,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:59:20,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:59:20,521 INFO L87 Difference]: Start difference. First operand 157 states and 215 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:20,561 INFO L93 Difference]: Finished difference Result 311 states and 427 transitions. [2025-01-09 15:59:20,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:59:20,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-01-09 15:59:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:20,564 INFO L225 Difference]: With dead ends: 311 [2025-01-09 15:59:20,564 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 15:59:20,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:59:20,566 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:20,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:59:20,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 15:59:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-01-09 15:59:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 133 states have (on average 1.3383458646616542) internal successors, (178), 133 states have internal predecessors, (178), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:59:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 214 transitions. [2025-01-09 15:59:20,583 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 214 transitions. Word has length 84 [2025-01-09 15:59:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:20,583 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 214 transitions. [2025-01-09 15:59:20,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2025-01-09 15:59:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 15:59:20,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:20,585 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:20,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 15:59:20,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:20,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:20,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:20,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1763904088, now seen corresponding path program 1 times [2025-01-09 15:59:20,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:20,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347993053] [2025-01-09 15:59:20,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:20,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:20,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:20,788 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:20,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-01-09 15:59:20,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 15:59:20,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 15:59:20,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:20,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:20,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 15:59:20,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:20,948 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-01-09 15:59:21,149 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 52 treesize of output 24 [2025-01-09 15:59:21,224 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 47 treesize of output 34 [2025-01-09 15:59:21,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:21,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 37 [2025-01-09 15:59:21,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:21,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 48 [2025-01-09 15:59:21,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:21,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 52 [2025-01-09 15:59:23,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:23,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 43 [2025-01-09 15:59:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 15:59:23,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:59:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:59:23,851 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:23,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347993053] [2025-01-09 15:59:23,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347993053] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:59:23,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:59:23,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 19 [2025-01-09 15:59:23,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736567484] [2025-01-09 15:59:23,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:23,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:59:23,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:23,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:59:23,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=277, Unknown=1, NotChecked=0, Total=342 [2025-01-09 15:59:23,852 INFO L87 Difference]: Start difference. First operand 157 states and 214 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:24,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:24,298 INFO L93 Difference]: Finished difference Result 414 states and 567 transitions. [2025-01-09 15:59:24,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:59:24,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2025-01-09 15:59:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:24,300 INFO L225 Difference]: With dead ends: 414 [2025-01-09 15:59:24,300 INFO L226 Difference]: Without dead ends: 260 [2025-01-09 15:59:24,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=76, Invalid=385, Unknown=1, NotChecked=0, Total=462 [2025-01-09 15:59:24,301 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 86 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:24,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 369 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:59:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-01-09 15:59:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 251. [2025-01-09 15:59:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 225 states have (on average 1.3733333333333333) internal successors, (309), 226 states have internal predecessors, (309), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:59:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 347 transitions. [2025-01-09 15:59:24,312 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 347 transitions. Word has length 86 [2025-01-09 15:59:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:24,312 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 347 transitions. [2025-01-09 15:59:24,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 347 transitions. [2025-01-09 15:59:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 15:59:24,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:24,313 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:24,320 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 (9)] Ended with exit code 0 [2025-01-09 15:59:24,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:24,514 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:24,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:24,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1939045108, now seen corresponding path program 1 times [2025-01-09 15:59:24,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:24,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004901768] [2025-01-09 15:59:24,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:24,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:24,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:24,517 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:24,518 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 (10)] Waiting until timeout for monitored process [2025-01-09 15:59:24,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 15:59:24,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 15:59:24,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:24,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:24,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:59:24,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:24,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:24,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 24 [2025-01-09 15:59:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:59:24,800 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:24,800 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:24,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004901768] [2025-01-09 15:59:24,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004901768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:24,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:24,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:59:24,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743300118] [2025-01-09 15:59:24,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:24,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:59:24,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:24,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:59:24,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:59:24,801 INFO L87 Difference]: Start difference. First operand 251 states and 347 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:25,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:25,683 INFO L93 Difference]: Finished difference Result 699 states and 963 transitions. [2025-01-09 15:59:25,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:59:25,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2025-01-09 15:59:25,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:25,687 INFO L225 Difference]: With dead ends: 699 [2025-01-09 15:59:25,687 INFO L226 Difference]: Without dead ends: 451 [2025-01-09 15:59:25,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:59:25,688 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 112 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:25,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 319 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:59:25,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-01-09 15:59:25,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 427. [2025-01-09 15:59:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 376 states have (on average 1.3430851063829787) internal successors, (505), 378 states have internal predecessors, (505), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:59:25,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 581 transitions. [2025-01-09 15:59:25,718 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 581 transitions. Word has length 86 [2025-01-09 15:59:25,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:25,718 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 581 transitions. [2025-01-09 15:59:25,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:25,719 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 581 transitions. [2025-01-09 15:59:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 15:59:25,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:25,720 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:25,727 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 (10)] Ended with exit code 0 [2025-01-09 15:59:25,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:25,921 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:25,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:25,922 INFO L85 PathProgramCache]: Analyzing trace with hash -346272196, now seen corresponding path program 1 times [2025-01-09 15:59:25,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:25,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486863858] [2025-01-09 15:59:25,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:25,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:25,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:25,924 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:25,925 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 (11)] Waiting until timeout for monitored process [2025-01-09 15:59:25,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 15:59:26,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 15:59:26,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:26,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:26,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 15:59:26,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:26,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:59:26,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:26,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 67 [2025-01-09 15:59:26,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:26,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 70 [2025-01-09 15:59:26,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:26,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 70 [2025-01-09 15:59:26,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:26,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 70 [2025-01-09 15:59:26,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:26,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 81 [2025-01-09 15:59:27,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:27,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 70 [2025-01-09 15:59:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 15:59:27,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:59:27,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:27,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486863858] [2025-01-09 15:59:27,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486863858] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:59:27,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1821496159] [2025-01-09 15:59:27,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:27,405 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:59:27,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:59:27,407 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:59:27,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-01-09 15:59:27,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 15:59:28,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 15:59:28,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:28,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:28,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 15:59:28,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:28,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2025-01-09 15:59:33,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:33,604 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 1 case distinctions, treesize of input 110 treesize of output 57 [2025-01-09 15:59:33,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:33,768 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 1 case distinctions, treesize of input 110 treesize of output 57 [2025-01-09 15:59:33,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:33,964 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 1 case distinctions, treesize of input 107 treesize of output 65 [2025-01-09 15:59:34,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:34,209 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 3 case distinctions, treesize of input 100 treesize of output 74 [2025-01-09 15:59:34,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:34,382 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 6 case distinctions, treesize of input 102 treesize of output 90 [2025-01-09 15:59:34,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:34,543 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 10 case distinctions, treesize of input 143 treesize of output 79 [2025-01-09 15:59:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 15:59:39,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:59:39,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1821496159] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:59:39,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:59:39,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2025-01-09 15:59:39,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098853727] [2025-01-09 15:59:39,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:59:39,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 15:59:39,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:39,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 15:59:39,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=587, Unknown=2, NotChecked=0, Total=702 [2025-01-09 15:59:39,453 INFO L87 Difference]: Start difference. First operand 427 states and 581 transitions. Second operand has 25 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 21 states have internal predecessors, (82), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-01-09 15:59:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:44,684 INFO L93 Difference]: Finished difference Result 1145 states and 1549 transitions. [2025-01-09 15:59:44,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 15:59:44,686 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 21 states have internal predecessors, (82), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 86 [2025-01-09 15:59:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:44,688 INFO L225 Difference]: With dead ends: 1145 [2025-01-09 15:59:44,689 INFO L226 Difference]: Without dead ends: 721 [2025-01-09 15:59:44,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 190 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=357, Invalid=1447, Unknown=2, NotChecked=0, Total=1806 [2025-01-09 15:59:44,691 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 752 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:44,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1088 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 15:59:44,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-01-09 15:59:44,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 463. [2025-01-09 15:59:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 398 states have (on average 1.3241206030150754) internal successors, (527), 402 states have internal predecessors, (527), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 15:59:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 623 transitions. [2025-01-09 15:59:44,729 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 623 transitions. Word has length 86 [2025-01-09 15:59:44,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:44,729 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 623 transitions. [2025-01-09 15:59:44,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 21 states have internal predecessors, (82), 5 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2025-01-09 15:59:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 623 transitions. [2025-01-09 15:59:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 15:59:44,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:44,731 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:44,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-01-09 15:59:44,939 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 (11)] Ended with exit code 0 [2025-01-09 15:59:45,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:45,133 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:45,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:45,133 INFO L85 PathProgramCache]: Analyzing trace with hash 492761466, now seen corresponding path program 1 times [2025-01-09 15:59:45,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:45,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579816188] [2025-01-09 15:59:45,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:45,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:45,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:45,135 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:45,136 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 (13)] Waiting until timeout for monitored process [2025-01-09 15:59:45,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 15:59:45,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 15:59:45,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:45,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:45,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:59:45,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 15:59:45,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:45,328 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:45,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579816188] [2025-01-09 15:59:45,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579816188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:45,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:45,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:59:45,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145639374] [2025-01-09 15:59:45,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:45,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:59:45,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:45,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:59:45,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:59:45,329 INFO L87 Difference]: Start difference. First operand 463 states and 623 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:59:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:45,453 INFO L93 Difference]: Finished difference Result 833 states and 1103 transitions. [2025-01-09 15:59:45,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:59:45,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2025-01-09 15:59:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:45,455 INFO L225 Difference]: With dead ends: 833 [2025-01-09 15:59:45,457 INFO L226 Difference]: Without dead ends: 349 [2025-01-09 15:59:45,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:59:45,459 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:45,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 553 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:59:45,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-01-09 15:59:45,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 273. [2025-01-09 15:59:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 232 states have (on average 1.271551724137931) internal successors, (295), 234 states have internal predecessors, (295), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:59:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 351 transitions. [2025-01-09 15:59:45,479 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 351 transitions. Word has length 86 [2025-01-09 15:59:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:45,479 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 351 transitions. [2025-01-09 15:59:45,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:59:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 351 transitions. [2025-01-09 15:59:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 15:59:45,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:45,482 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:45,489 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 (13)] Ended with exit code 0 [2025-01-09 15:59:45,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:45,682 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:45,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:45,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1706324780, now seen corresponding path program 1 times [2025-01-09 15:59:45,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:45,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717434485] [2025-01-09 15:59:45,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:45,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:45,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:45,685 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:45,686 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 (14)] Waiting until timeout for monitored process [2025-01-09 15:59:45,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 15:59:45,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 15:59:45,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:45,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:45,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:59:45,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:59:45,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:45,942 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:45,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717434485] [2025-01-09 15:59:45,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717434485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:45,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:45,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:59:45,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73292266] [2025-01-09 15:59:45,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:45,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:59:45,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:45,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:59:45,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:59:45,943 INFO L87 Difference]: Start difference. First operand 273 states and 351 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:59:46,355 INFO L93 Difference]: Finished difference Result 825 states and 1058 transitions. [2025-01-09 15:59:46,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:59:46,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2025-01-09 15:59:46,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:59:46,358 INFO L225 Difference]: With dead ends: 825 [2025-01-09 15:59:46,358 INFO L226 Difference]: Without dead ends: 555 [2025-01-09 15:59:46,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:59:46,359 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 209 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:59:46,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 248 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:59:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-01-09 15:59:46,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 416. [2025-01-09 15:59:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 355 states have (on average 1.2563380281690142) internal successors, (446), 358 states have internal predecessors, (446), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:59:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 530 transitions. [2025-01-09 15:59:46,400 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 530 transitions. Word has length 87 [2025-01-09 15:59:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:59:46,401 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 530 transitions. [2025-01-09 15:59:46,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:59:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 530 transitions. [2025-01-09 15:59:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 15:59:46,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:59:46,402 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:59:46,409 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 (14)] Ended with exit code 0 [2025-01-09 15:59:46,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:46,603 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:59:46,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:59:46,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1665262479, now seen corresponding path program 1 times [2025-01-09 15:59:46,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:59:46,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128923600] [2025-01-09 15:59:46,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:59:46,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:59:46,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:59:46,606 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:59:46,608 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 (15)] Waiting until timeout for monitored process [2025-01-09 15:59:46,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 15:59:46,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 15:59:46,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:59:46,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:59:46,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 15:59:46,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:59:46,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:59:47,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:47,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 59 [2025-01-09 15:59:47,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:47,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 59 [2025-01-09 15:59:47,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:47,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 69 [2025-01-09 15:59:47,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:47,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-01-09 15:59:48,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:48,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 92 [2025-01-09 15:59:48,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:48,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 165 treesize of output 105 [2025-01-09 15:59:50,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:50,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 176 treesize of output 108 [2025-01-09 15:59:50,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:59:50,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 201 treesize of output 69 [2025-01-09 15:59:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 15:59:51,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:59:51,011 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:59:51,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128923600] [2025-01-09 15:59:51,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128923600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:59:51,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:59:51,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:59:51,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107250064] [2025-01-09 15:59:51,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:59:51,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:59:51,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:59:51,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:59:51,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=76, Unknown=1, NotChecked=0, Total=110 [2025-01-09 15:59:51,012 INFO L87 Difference]: Start difference. First operand 416 states and 530 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:59:55,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:59:57,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:00:00,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:00:03,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:00:05,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:00:09,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:00:13,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:00:15,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:00:18,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:00:21,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:00:23,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:00:26,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:00:29,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:00:32,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:00:35,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:00:38,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]