./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-67.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-67.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 d61878ad7bbd2e78c0c21aa8a02e9f4c78650f9979388720421c5a099639b1a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:01:33,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:01:34,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:01:34,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:01:34,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:01:34,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:01:34,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:01:34,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:01:34,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:01:34,047 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:01:34,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:01:34,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:01:34,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:01:34,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:01:34,048 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:01:34,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:01:34,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:01:34,048 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:01:34,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:01:34,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:01:34,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:01:34,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:01:34,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:01:34,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:01:34,050 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:01:34,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:01:34,050 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:01:34,051 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:01:34,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:01:34,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:01:34,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:01:34,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:01:34,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:01:34,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:01:34,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:01:34,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:01:34,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:01:34,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:01:34,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:01:34,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:01:34,053 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:01:34,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:01:34,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:01:34,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:01:34,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:01:34,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:01:34,054 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:01:34,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:01:34,054 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 -> d61878ad7bbd2e78c0c21aa8a02e9f4c78650f9979388720421c5a099639b1a0 [2025-01-09 16:01:34,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:01:34,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:01:34,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:01:34,324 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:01:34,324 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:01:34,325 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-67.i [2025-01-09 16:01:35,547 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b872c209/41b4bd0b8bf4423e8a1b8fdc85a9a4d9/FLAG5812f347d [2025-01-09 16:01:35,839 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:01:35,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-67.i [2025-01-09 16:01:35,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b872c209/41b4bd0b8bf4423e8a1b8fdc85a9a4d9/FLAG5812f347d [2025-01-09 16:01:35,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b872c209/41b4bd0b8bf4423e8a1b8fdc85a9a4d9 [2025-01-09 16:01:35,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:01:35,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:01:35,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:01:35,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:01:35,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:01:35,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:35" (1/1) ... [2025-01-09 16:01:35,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6626b782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:35, skipping insertion in model container [2025-01-09 16:01:35,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:35" (1/1) ... [2025-01-09 16:01:35,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:01:36,003 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-67.i[916,929] [2025-01-09 16:01:36,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:01:36,059 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:01:36,068 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-67.i[916,929] [2025-01-09 16:01:36,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:01:36,122 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:01:36,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:36 WrapperNode [2025-01-09 16:01:36,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:01:36,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:01:36,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:01:36,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:01:36,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:36" (1/1) ... [2025-01-09 16:01:36,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:36" (1/1) ... [2025-01-09 16:01:36,172 INFO L138 Inliner]: procedures = 30, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 398 [2025-01-09 16:01:36,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:01:36,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:01:36,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:01:36,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:01:36,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:36" (1/1) ... [2025-01-09 16:01:36,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:36" (1/1) ... [2025-01-09 16:01:36,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:36" (1/1) ... [2025-01-09 16:01:36,197 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:01:36,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:36" (1/1) ... [2025-01-09 16:01:36,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:36" (1/1) ... [2025-01-09 16:01:36,219 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:36" (1/1) ... [2025-01-09 16:01:36,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:36" (1/1) ... [2025-01-09 16:01:36,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:36" (1/1) ... [2025-01-09 16:01:36,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:36" (1/1) ... [2025-01-09 16:01:36,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:36" (1/1) ... [2025-01-09 16:01:36,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:01:36,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:01:36,245 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:01:36,245 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:01:36,246 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:36" (1/1) ... [2025-01-09 16:01:36,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:01:36,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:01:36,278 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:01:36,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:01:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:01:36,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:01:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:01:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:01:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:01:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:01:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:01:36,302 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:01:36,302 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:01:36,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:01:36,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:01:36,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:01:36,415 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:01:36,416 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:01:36,857 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-01-09 16:01:36,857 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:01:36,867 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:01:36,868 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:01:36,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:36 BoogieIcfgContainer [2025-01-09 16:01:36,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:01:36,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:01:36,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:01:36,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:01:36,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:01:35" (1/3) ... [2025-01-09 16:01:36,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684d662d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:01:36, skipping insertion in model container [2025-01-09 16:01:36,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:36" (2/3) ... [2025-01-09 16:01:36,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684d662d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:01:36, skipping insertion in model container [2025-01-09 16:01:36,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:36" (3/3) ... [2025-01-09 16:01:36,878 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-67.i [2025-01-09 16:01:36,890 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:01:36,891 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-67.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:01:36,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:01:36,941 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;@451a16e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:01:36,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:01:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 78 states have internal predecessors, (107), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:01:36,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:01:36,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:36,954 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:36,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:36,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash -390461846, now seen corresponding path program 1 times [2025-01-09 16:01:36,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:36,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247368077] [2025-01-09 16:01:36,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:36,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:37,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:01:37,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:01:37,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:37,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 16:01:37,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:37,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247368077] [2025-01-09 16:01:37,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247368077] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:01:37,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761309383] [2025-01-09 16:01:37,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:37,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:01:37,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:01:37,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:01:37,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:01:37,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:01:37,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:01:37,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:37,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:37,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:01:37,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:01:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 16:01:37,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:01:37,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761309383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:37,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:01:37,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:01:37,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410005575] [2025-01-09 16:01:37,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:37,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:01:37,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:37,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:01:37,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:01:37,637 INFO L87 Difference]: Start difference. First operand has 92 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 78 states have internal predecessors, (107), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:01:37,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:37,660 INFO L93 Difference]: Finished difference Result 178 states and 269 transitions. [2025-01-09 16:01:37,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:01:37,662 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-01-09 16:01:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:37,668 INFO L225 Difference]: With dead ends: 178 [2025-01-09 16:01:37,668 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 16:01:37,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:01:37,672 INFO L435 NwaCegarLoop]: 126 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, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:37,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:01:37,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 16:01:37,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 16:01:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:01:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2025-01-09 16:01:37,709 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 104 [2025-01-09 16:01:37,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:37,710 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2025-01-09 16:01:37,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:01:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2025-01-09 16:01:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:01:37,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:37,713 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:37,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:01:37,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 16:01:37,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:37,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash 845060030, now seen corresponding path program 1 times [2025-01-09 16:01:37,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:37,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676995497] [2025-01-09 16:01:37,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:37,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:37,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:01:38,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:01:38,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:38,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:01:38,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:38,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676995497] [2025-01-09 16:01:38,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676995497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:38,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:38,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:01:38,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557147164] [2025-01-09 16:01:38,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:38,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:01:38,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:38,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:01:38,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:01:38,307 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:38,352 INFO L93 Difference]: Finished difference Result 178 states and 253 transitions. [2025-01-09 16:01:38,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:01:38,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 16:01:38,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:38,354 INFO L225 Difference]: With dead ends: 178 [2025-01-09 16:01:38,354 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 16:01:38,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:01:38,356 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:38,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 358 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:01:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 16:01:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-01-09 16:01:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:01:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2025-01-09 16:01:38,373 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 104 [2025-01-09 16:01:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:38,374 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2025-01-09 16:01:38,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2025-01-09 16:01:38,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:01:38,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:38,377 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:38,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:01:38,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:38,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:38,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1525118400, now seen corresponding path program 1 times [2025-01-09 16:01:38,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:38,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621759583] [2025-01-09 16:01:38,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:38,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:38,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:01:38,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:01:38,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:38,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:01:38,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:38,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621759583] [2025-01-09 16:01:38,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621759583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:38,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:38,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:01:38,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239655280] [2025-01-09 16:01:38,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:38,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:01:38,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:38,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:01:38,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:01:38,569 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:38,605 INFO L93 Difference]: Finished difference Result 182 states and 257 transitions. [2025-01-09 16:01:38,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:01:38,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 16:01:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:38,608 INFO L225 Difference]: With dead ends: 182 [2025-01-09 16:01:38,608 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 16:01:38,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:01:38,609 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:38,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 359 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:01:38,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 16:01:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-01-09 16:01:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:01:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2025-01-09 16:01:38,617 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 104 [2025-01-09 16:01:38,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:38,618 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2025-01-09 16:01:38,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2025-01-09 16:01:38,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:01:38,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:38,623 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:38,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:01:38,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:38,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:38,624 INFO L85 PathProgramCache]: Analyzing trace with hash -994841534, now seen corresponding path program 1 times [2025-01-09 16:01:38,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:38,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646164436] [2025-01-09 16:01:38,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:38,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:38,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:01:38,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:01:38,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:38,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:01:38,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:38,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646164436] [2025-01-09 16:01:38,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646164436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:38,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:38,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:01:38,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182580395] [2025-01-09 16:01:38,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:38,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:01:38,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:38,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:01:38,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:01:38,790 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:38,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:38,817 INFO L93 Difference]: Finished difference Result 186 states and 261 transitions. [2025-01-09 16:01:38,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:01:38,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 16:01:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:38,822 INFO L225 Difference]: With dead ends: 186 [2025-01-09 16:01:38,822 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 16:01:38,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:01:38,823 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:38,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 361 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:01:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 16:01:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-01-09 16:01:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:01:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-01-09 16:01:38,835 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 104 [2025-01-09 16:01:38,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:38,835 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-01-09 16:01:38,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-01-09 16:01:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:01:38,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:38,837 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:38,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:01:38,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:38,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:38,837 INFO L85 PathProgramCache]: Analyzing trace with hash -992994492, now seen corresponding path program 1 times [2025-01-09 16:01:38,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:38,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915426156] [2025-01-09 16:01:38,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:38,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:38,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:01:39,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:01:39,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:39,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:01:43,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:43,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915426156] [2025-01-09 16:01:43,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915426156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:43,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:43,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:01:43,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678621106] [2025-01-09 16:01:43,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:43,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:01:43,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:43,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:01:43,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:01:43,050 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 16:01:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:44,425 INFO L93 Difference]: Finished difference Result 312 states and 430 transitions. [2025-01-09 16:01:44,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:01:44,427 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2025-01-09 16:01:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:44,428 INFO L225 Difference]: With dead ends: 312 [2025-01-09 16:01:44,428 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 16:01:44,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:01:44,434 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 492 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:44,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 619 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 16:01:44,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 16:01:44,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 114. [2025-01-09 16:01:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 99 states have (on average 1.3535353535353536) internal successors, (134), 99 states have internal predecessors, (134), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:01:44,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 158 transitions. [2025-01-09 16:01:44,459 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 158 transitions. Word has length 104 [2025-01-09 16:01:44,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:44,460 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 158 transitions. [2025-01-09 16:01:44,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 16:01:44,460 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 158 transitions. [2025-01-09 16:01:44,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:01:44,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:44,462 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:44,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:01:44,463 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:44,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:44,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1496534470, now seen corresponding path program 1 times [2025-01-09 16:01:44,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:44,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171927563] [2025-01-09 16:01:44,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:44,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:44,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:01:44,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:01:44,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:44,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:01:44,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:44,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171927563] [2025-01-09 16:01:44,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171927563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:44,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:44,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:01:44,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50657869] [2025-01-09 16:01:44,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:44,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:01:44,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:44,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:01:44,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:01:44,542 INFO L87 Difference]: Start difference. First operand 114 states and 158 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:44,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:44,602 INFO L93 Difference]: Finished difference Result 279 states and 387 transitions. [2025-01-09 16:01:44,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:01:44,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-01-09 16:01:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:44,604 INFO L225 Difference]: With dead ends: 279 [2025-01-09 16:01:44,604 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 16:01:44,605 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 16:01:44,605 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 61 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:44,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 315 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:01:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 16:01:44,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 128. [2025-01-09 16:01:44,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 113 states have (on average 1.3716814159292035) internal successors, (155), 113 states have internal predecessors, (155), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:01:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 179 transitions. [2025-01-09 16:01:44,627 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 179 transitions. Word has length 104 [2025-01-09 16:01:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:44,627 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 179 transitions. [2025-01-09 16:01:44,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 179 transitions. [2025-01-09 16:01:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 16:01:44,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:44,628 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:44,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:01:44,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:44,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:44,629 INFO L85 PathProgramCache]: Analyzing trace with hash -692334791, now seen corresponding path program 1 times [2025-01-09 16:01:44,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:44,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700317704] [2025-01-09 16:01:44,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:44,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:44,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 16:01:44,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 16:01:44,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:44,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:01:46,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:46,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700317704] [2025-01-09 16:01:46,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700317704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:46,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:46,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:01:46,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559909271] [2025-01-09 16:01:46,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:46,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:01:46,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:46,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:01:46,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:01:46,338 INFO L87 Difference]: Start difference. First operand 128 states and 179 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:01:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:46,764 INFO L93 Difference]: Finished difference Result 294 states and 408 transitions. [2025-01-09 16:01:46,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:01:46,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-01-09 16:01:46,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:46,767 INFO L225 Difference]: With dead ends: 294 [2025-01-09 16:01:46,767 INFO L226 Difference]: Without dead ends: 169 [2025-01-09 16:01:46,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:01:46,768 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 59 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:46,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 397 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:01:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-01-09 16:01:46,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 115. [2025-01-09 16:01:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 100 states have (on average 1.34) internal successors, (134), 100 states have internal predecessors, (134), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:01:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2025-01-09 16:01:46,788 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 105 [2025-01-09 16:01:46,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:46,789 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2025-01-09 16:01:46,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:01:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2025-01-09 16:01:46,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 16:01:46,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:46,791 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:46,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:01:46,791 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:46,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:46,792 INFO L85 PathProgramCache]: Analyzing trace with hash 831342931, now seen corresponding path program 1 times [2025-01-09 16:01:46,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:46,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393185756] [2025-01-09 16:01:46,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:46,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:46,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:01:46,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:01:46,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:46,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:47,619 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:01:47,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:47,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393185756] [2025-01-09 16:01:47,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393185756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:47,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:47,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:01:47,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915121860] [2025-01-09 16:01:47,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:47,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:01:47,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:47,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:01:47,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:01:47,621 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:01:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:47,964 INFO L93 Difference]: Finished difference Result 307 states and 419 transitions. [2025-01-09 16:01:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:01:47,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-01-09 16:01:47,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:47,967 INFO L225 Difference]: With dead ends: 307 [2025-01-09 16:01:47,967 INFO L226 Difference]: Without dead ends: 195 [2025-01-09 16:01:47,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:01:47,968 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 66 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:47,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 544 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:01:47,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-09 16:01:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2025-01-09 16:01:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 172 states have internal predecessors, (229), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:01:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 261 transitions. [2025-01-09 16:01:47,983 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 261 transitions. Word has length 108 [2025-01-09 16:01:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:47,983 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 261 transitions. [2025-01-09 16:01:47,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:01:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 261 transitions. [2025-01-09 16:01:47,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 16:01:47,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:47,985 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:47,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:01:47,986 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:47,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:47,986 INFO L85 PathProgramCache]: Analyzing trace with hash -771149704, now seen corresponding path program 1 times [2025-01-09 16:01:47,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:47,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805459704] [2025-01-09 16:01:47,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:47,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:48,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:01:48,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:01:48,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:48,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:01:48,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:48,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805459704] [2025-01-09 16:01:48,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805459704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:48,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:48,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:01:48,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964774634] [2025-01-09 16:01:48,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:48,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:01:48,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:48,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:01:48,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:01:48,936 INFO L87 Difference]: Start difference. First operand 192 states and 261 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:49,515 INFO L93 Difference]: Finished difference Result 440 states and 601 transitions. [2025-01-09 16:01:49,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:01:49,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-01-09 16:01:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:49,519 INFO L225 Difference]: With dead ends: 440 [2025-01-09 16:01:49,519 INFO L226 Difference]: Without dead ends: 251 [2025-01-09 16:01:49,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:01:49,522 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 51 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:49,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 570 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:01:49,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-01-09 16:01:49,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 220. [2025-01-09 16:01:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 199 states have (on average 1.3618090452261307) internal successors, (271), 200 states have internal predecessors, (271), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:01:49,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 303 transitions. [2025-01-09 16:01:49,542 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 303 transitions. Word has length 110 [2025-01-09 16:01:49,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:49,543 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 303 transitions. [2025-01-09 16:01:49,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 303 transitions. [2025-01-09 16:01:49,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 16:01:49,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:49,544 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:49,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:01:49,544 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:49,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:49,545 INFO L85 PathProgramCache]: Analyzing trace with hash -222103048, now seen corresponding path program 1 times [2025-01-09 16:01:49,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:49,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104011850] [2025-01-09 16:01:49,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:49,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:49,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:01:49,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:01:49,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:49,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:01:50,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:50,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104011850] [2025-01-09 16:01:50,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104011850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:50,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:50,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:01:50,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402253162] [2025-01-09 16:01:50,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:50,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:01:50,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:50,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:01:50,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:01:50,387 INFO L87 Difference]: Start difference. First operand 220 states and 303 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:51,039 INFO L93 Difference]: Finished difference Result 441 states and 607 transitions. [2025-01-09 16:01:51,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:01:51,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-01-09 16:01:51,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:51,042 INFO L225 Difference]: With dead ends: 441 [2025-01-09 16:01:51,042 INFO L226 Difference]: Without dead ends: 224 [2025-01-09 16:01:51,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:01:51,043 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 61 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:51,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 647 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:01:51,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-09 16:01:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2025-01-09 16:01:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 201 states have (on average 1.3582089552238805) internal successors, (273), 202 states have internal predecessors, (273), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:01:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 305 transitions. [2025-01-09 16:01:51,056 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 305 transitions. Word has length 110 [2025-01-09 16:01:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:51,056 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 305 transitions. [2025-01-09 16:01:51,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 305 transitions. [2025-01-09 16:01:51,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 16:01:51,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:51,058 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:51,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:01:51,058 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:51,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:51,059 INFO L85 PathProgramCache]: Analyzing trace with hash -899639124, now seen corresponding path program 1 times [2025-01-09 16:01:51,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:51,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623127422] [2025-01-09 16:01:51,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:51,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:51,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:01:51,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:01:51,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:51,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:01:51,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:51,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623127422] [2025-01-09 16:01:51,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623127422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:51,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:51,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:01:51,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436587011] [2025-01-09 16:01:51,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:51,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:01:51,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:51,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:01:51,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:01:51,512 INFO L87 Difference]: Start difference. First operand 222 states and 305 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:51,843 INFO L93 Difference]: Finished difference Result 549 states and 750 transitions. [2025-01-09 16:01:51,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:01:51,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-01-09 16:01:51,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:51,846 INFO L225 Difference]: With dead ends: 549 [2025-01-09 16:01:51,846 INFO L226 Difference]: Without dead ends: 330 [2025-01-09 16:01:51,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:01:51,847 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 60 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:51,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 375 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:01:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-09 16:01:51,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 248. [2025-01-09 16:01:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 227 states have (on average 1.3700440528634361) internal successors, (311), 228 states have internal predecessors, (311), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:01:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 343 transitions. [2025-01-09 16:01:51,868 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 343 transitions. Word has length 111 [2025-01-09 16:01:51,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:51,868 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 343 transitions. [2025-01-09 16:01:51,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 343 transitions. [2025-01-09 16:01:51,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 16:01:51,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:51,871 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:51,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:01:51,871 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:51,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:51,871 INFO L85 PathProgramCache]: Analyzing trace with hash 595155117, now seen corresponding path program 1 times [2025-01-09 16:01:51,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:51,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269869993] [2025-01-09 16:01:51,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:51,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:51,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:01:51,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:01:51,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:51,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:01:52,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:52,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269869993] [2025-01-09 16:01:52,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269869993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:52,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:52,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:01:52,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720847278] [2025-01-09 16:01:52,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:52,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:01:52,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:52,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:01:52,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:01:52,311 INFO L87 Difference]: Start difference. First operand 248 states and 343 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:52,627 INFO L93 Difference]: Finished difference Result 573 states and 784 transitions. [2025-01-09 16:01:52,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:01:52,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-01-09 16:01:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:52,630 INFO L225 Difference]: With dead ends: 573 [2025-01-09 16:01:52,630 INFO L226 Difference]: Without dead ends: 328 [2025-01-09 16:01:52,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:01:52,633 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 65 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:52,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 445 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:01:52,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-01-09 16:01:52,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 248. [2025-01-09 16:01:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 227 states have (on average 1.3612334801762114) internal successors, (309), 228 states have internal predecessors, (309), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:01:52,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 341 transitions. [2025-01-09 16:01:52,655 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 341 transitions. Word has length 111 [2025-01-09 16:01:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:52,655 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 341 transitions. [2025-01-09 16:01:52,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:01:52,658 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 341 transitions. [2025-01-09 16:01:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 16:01:52,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:52,660 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:52,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:01:52,660 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:52,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:52,660 INFO L85 PathProgramCache]: Analyzing trace with hash -79484963, now seen corresponding path program 1 times [2025-01-09 16:01:52,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:52,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121334142] [2025-01-09 16:01:52,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:52,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:52,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:52,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:52,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:01:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:01:53,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:01:53,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121334142] [2025-01-09 16:01:53,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121334142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:01:53,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:01:53,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:01:53,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571818331] [2025-01-09 16:01:53,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:01:53,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:01:53,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:01:53,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:01:53,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:01:53,542 INFO L87 Difference]: Start difference. First operand 248 states and 341 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:01:54,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:01:54,012 INFO L93 Difference]: Finished difference Result 274 states and 370 transitions. [2025-01-09 16:01:54,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:01:54,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2025-01-09 16:01:54,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:01:54,014 INFO L225 Difference]: With dead ends: 274 [2025-01-09 16:01:54,015 INFO L226 Difference]: Without dead ends: 272 [2025-01-09 16:01:54,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:01:54,016 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 53 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:01:54,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 519 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:01:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-01-09 16:01:54,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 220. [2025-01-09 16:01:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 199 states have (on average 1.35678391959799) internal successors, (270), 200 states have internal predecessors, (270), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:01:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 302 transitions. [2025-01-09 16:01:54,039 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 302 transitions. Word has length 112 [2025-01-09 16:01:54,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:01:54,039 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 302 transitions. [2025-01-09 16:01:54,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:01:54,039 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 302 transitions. [2025-01-09 16:01:54,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 16:01:54,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:01:54,046 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:54,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:01:54,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:01:54,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:01:54,047 INFO L85 PathProgramCache]: Analyzing trace with hash -77637921, now seen corresponding path program 1 times [2025-01-09 16:01:54,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:01:54,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528307371] [2025-01-09 16:01:54,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:54,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:01:54,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:54,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:54,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:54,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:01:54,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [966907278] [2025-01-09 16:01:54,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:01:54,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:01:54,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:01:54,145 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 16:01:54,147 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 16:01:54,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:54,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:54,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:54,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:01:54,667 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:01:54,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:01:54,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:01:54,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:01:54,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:01:55,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:01:55,096 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:01:55,097 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:01:55,108 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 16:01:55,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:01:55,301 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:01:55,358 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:01:55,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:01:55 BoogieIcfgContainer [2025-01-09 16:01:55,363 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:01:55,364 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:01:55,364 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:01:55,364 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:01:55,365 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:36" (3/4) ... [2025-01-09 16:01:55,367 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:01:55,367 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:01:55,368 INFO L158 Benchmark]: Toolchain (without parser) took 19500.95ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 106.6MB in the beginning and 442.8MB in the end (delta: -336.2MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. [2025-01-09 16:01:55,368 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:01:55,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.32ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 91.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:01:55,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.36ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.3MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:01:55,369 INFO L158 Benchmark]: Boogie Preprocessor took 70.90ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:01:55,369 INFO L158 Benchmark]: RCFGBuilder took 624.23ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 56.9MB in the end (delta: 28.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:01:55,369 INFO L158 Benchmark]: TraceAbstraction took 18492.73ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 55.8MB in the beginning and 443.0MB in the end (delta: -387.1MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2025-01-09 16:01:55,369 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 578.8MB. Free memory was 443.0MB in the beginning and 442.8MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:01:55,370 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.79ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.32ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 91.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.36ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 88.3MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.90ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 624.23ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 56.9MB in the end (delta: 28.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18492.73ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 55.8MB in the beginning and 443.0MB in the end (delta: -387.1MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 578.8MB. Free memory was 443.0MB in the beginning and 442.8MB in the end (delta: 184.7kB). 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 someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 111. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 2, -64, 256, 128, 256, 50, 0, -4, 15.125, 0.9, 25.875, 50 }; [L51] signed short int last_1_WrapperStruct00_var_1_1 = 2; [L52] unsigned short int last_1_WrapperStruct00_var_1_6 = 128; [L53] signed long int last_1_WrapperStruct00_var_1_8 = 50; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L115] isInitial = 1 [L116] FCALL initially() [L118] CALL updateLastVariables() [L106] EXPR WrapperStruct00.var_1_1 [L106] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L107] EXPR WrapperStruct00.var_1_6 [L107] last_1_WrapperStruct00_var_1_6 = WrapperStruct00.var_1_6 [L108] EXPR WrapperStruct00.var_1_8 [L108] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L118] RET updateLastVariables() [L119] CALL updateVariables() [L86] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L87] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L88] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L92] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ushort() [L93] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L95] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L98] WrapperStruct00.var_1_10 = __VERIFIER_nondet_long() [L99] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L100] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L102] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_12 [L103] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_12 [L103] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L103] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L119] RET updateVariables() [L120] CALL step() [L57] COND TRUE ! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1) [L58] EXPR WrapperStruct00.var_1_4 [L58] EXPR WrapperStruct00.var_1_5 [L58] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5) [L60] EXPR WrapperStruct00.var_1_4 [L60] signed long int stepLocal_0 = 1 * WrapperStruct00.var_1_4; [L61] EXPR WrapperStruct00.var_1_1 [L61] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_0=5] [L61] EXPR WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_0=5] [L61] COND FALSE !((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > stepLocal_0) [L64] EXPR WrapperStruct00.var_1_7 [L64] WrapperStruct00.var_1_6 = WrapperStruct00.var_1_7 [L66] EXPR WrapperStruct00.var_1_12 [L66] WrapperStruct00.var_1_11 = WrapperStruct00.var_1_12 [L67] EXPR WrapperStruct00.var_1_12 [L67] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_12 [L68] EXPR WrapperStruct00.var_1_7 [L68] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_7 [L69] EXPR WrapperStruct00.var_1_4 [L69] EXPR WrapperStruct00.var_1_10 [L69] signed long int stepLocal_2 = WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10; [L70] EXPR WrapperStruct00.var_1_7 [L70] unsigned short int stepLocal_1 = WrapperStruct00.var_1_7; [L71] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_1=-65536, stepLocal_2=0] [L71] COND FALSE !(WrapperStruct00.var_1_9) [L74] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50, stepLocal_1=-65536, stepLocal_2=0] [L74] COND FALSE !(WrapperStruct00.var_1_14 > stepLocal_2) [L81] EXPR WrapperStruct00.var_1_6 [L81] EXPR WrapperStruct00.var_1_5 [L81] WrapperStruct00.var_1_8 = (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5) [L120] RET step() [L121] CALL, EXPR property() [L111] EXPR (! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1 [L111] EXPR WrapperStruct00.var_1_1 [L111] EXPR WrapperStruct00.var_1_4 [L111] EXPR WrapperStruct00.var_1_5 [L111] EXPR (! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR ((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7))) [L111] EXPR WrapperStruct00.var_1_1 [L111] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR ((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)) [L111] EXPR WrapperStruct00.var_1_6 [L111] EXPR WrapperStruct00.var_1_7 [L111] EXPR ((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR ((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR (((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5))))) [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))) [L111] EXPR WrapperStruct00.var_1_14 [L111] EXPR WrapperStruct00.var_1_4 [L111] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR (WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5))) [L111] EXPR WrapperStruct00.var_1_8 [L111] EXPR WrapperStruct00.var_1_6 [L111] EXPR WrapperStruct00.var_1_5 [L111] EXPR (WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR (((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR ((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))))) && (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12)) [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_12 [L111] EXPR ((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))))) && (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR (((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))))) && (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_12)) [L111] EXPR WrapperStruct00.var_1_13 [L111] EXPR WrapperStruct00.var_1_12 [L111] EXPR (((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))))) && (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111] EXPR ((((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))))) && (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_14 == ((unsigned short int) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L111-L112] return ((((((! (last_1_WrapperStruct00_var_1_6 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (((WrapperStruct00.var_1_1 >> WrapperStruct00.var_1_5) > (1 * WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_6 == ((unsigned short int) (((((42286 - WrapperStruct00.var_1_7)) > (0)) ? ((42286 - WrapperStruct00.var_1_7)) : (0))))) : (WrapperStruct00.var_1_6 == ((unsigned short int) WrapperStruct00.var_1_7)))) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_6) < (last_1_WrapperStruct00_var_1_8)) ? (WrapperStruct00.var_1_6) : (last_1_WrapperStruct00_var_1_8))))) : ((WrapperStruct00.var_1_14 > (WrapperStruct00.var_1_4 / WrapperStruct00.var_1_10)) ? ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_8 == ((signed long int) ((((WrapperStruct00.var_1_4) < (100)) ? (WrapperStruct00.var_1_4) : (100))))) : (WrapperStruct00.var_1_8 == ((signed long int) (last_1_WrapperStruct00_var_1_8 - WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_8 == ((signed long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_5)))))) && (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_14 == ((unsigned short int) WrapperStruct00.var_1_7)) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=2, last_1_WrapperStruct00_var_1_6=128, last_1_WrapperStruct00_var_1_8=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.4s, OverallIterations: 14, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 974 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 971 mSDsluCounter, 5635 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4031 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2792 IncrementalHoareTripleChecker+Invalid, 2924 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 1604 mSDtfsCounter, 2792 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=11, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 453 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 1719 NumberOfCodeBlocks, 1719 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1481 ConstructedInterpolants, 0 QuantifiedInterpolants, 6916 SizeOfPredicates, 0 NumberOfNonLiveVariables, 425 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 3674/3696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 16:01:55,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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-67.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 d61878ad7bbd2e78c0c21aa8a02e9f4c78650f9979388720421c5a099639b1a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:01:57,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:01:57,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 16:01:57,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:01:57,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:01:57,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:01:57,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:01:57,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:01:57,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:01:57,689 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:01:57,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:01:57,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:01:57,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:01:57,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:01:57,690 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:01:57,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:01:57,690 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:01:57,690 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:01:57,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:01:57,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:01:57,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:01:57,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:01:57,691 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:01:57,691 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:01:57,691 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:01:57,691 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:01:57,691 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:01:57,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:01:57,691 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:01:57,691 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:01:57,691 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:01:57,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:01:57,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:01:57,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:01:57,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:01:57,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:01:57,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:01:57,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:01:57,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:01:57,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:01:57,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:01:57,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:01:57,694 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:01:57,694 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:01:57,694 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:01:57,694 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:01:57,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:01:57,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:01:57,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:01:57,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:01:57,694 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 -> d61878ad7bbd2e78c0c21aa8a02e9f4c78650f9979388720421c5a099639b1a0 [2025-01-09 16:01:57,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:01:57,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:01:57,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:01:57,969 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:01:57,969 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:01:57,972 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-67.i [2025-01-09 16:01:59,313 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec8dfdbc6/b0eee78ff413400bb62b1cc6cd83e866/FLAG2e3d24f14 [2025-01-09 16:01:59,554 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:01:59,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-67.i [2025-01-09 16:01:59,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec8dfdbc6/b0eee78ff413400bb62b1cc6cd83e866/FLAG2e3d24f14 [2025-01-09 16:01:59,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec8dfdbc6/b0eee78ff413400bb62b1cc6cd83e866 [2025-01-09 16:01:59,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:01:59,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:01:59,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:01:59,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:01:59,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:01:59,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:59" (1/1) ... [2025-01-09 16:01:59,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c46db7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59, skipping insertion in model container [2025-01-09 16:01:59,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:59" (1/1) ... [2025-01-09 16:01:59,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:01:59,736 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-67.i[916,929] [2025-01-09 16:01:59,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:01:59,811 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:01:59,819 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-67.i[916,929] [2025-01-09 16:01:59,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:01:59,883 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:01:59,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59 WrapperNode [2025-01-09 16:01:59,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:01:59,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:01:59,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:01:59,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:01:59,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59" (1/1) ... [2025-01-09 16:01:59,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59" (1/1) ... [2025-01-09 16:01:59,935 INFO L138 Inliner]: procedures = 40, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 380 [2025-01-09 16:01:59,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:01:59,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:01:59,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:01:59,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:01:59,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59" (1/1) ... [2025-01-09 16:01:59,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59" (1/1) ... [2025-01-09 16:01:59,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59" (1/1) ... [2025-01-09 16:01:59,967 INFO L175 MemorySlicer]: Split 107 memory accesses to 2 slices as follows [2, 105]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2025-01-09 16:01:59,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59" (1/1) ... [2025-01-09 16:01:59,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59" (1/1) ... [2025-01-09 16:01:59,984 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59" (1/1) ... [2025-01-09 16:01:59,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59" (1/1) ... [2025-01-09 16:01:59,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59" (1/1) ... [2025-01-09 16:01:59,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59" (1/1) ... [2025-01-09 16:01:59,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59" (1/1) ... [2025-01-09 16:01:59,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:01:59,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:01:59,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:01:59,996 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:01:59,997 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59" (1/1) ... [2025-01-09 16:02:00,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:02:00,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:02:00,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:02:00,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:02:00,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:02:00,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 16:02:00,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 16:02:00,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-01-09 16:02:00,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-01-09 16:02:00,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 16:02:00,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 16:02:00,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:02:00,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:02:00,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:02:00,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:02:00,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 16:02:00,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 16:02:00,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 16:02:00,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 16:02:00,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 16:02:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 16:02:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 16:02:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 16:02:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 16:02:00,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 16:02:00,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 16:02:00,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 16:02:00,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 16:02:00,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 16:02:00,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:02:00,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:02:00,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-01-09 16:02:00,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-01-09 16:02:00,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:02:00,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:02:00,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:02:00,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:02:00,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 16:02:00,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 16:02:00,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 16:02:00,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 16:02:00,216 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:02:00,217 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:02:01,038 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-01-09 16:02:01,039 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:02:01,048 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:02:01,049 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:02:01,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:02:01 BoogieIcfgContainer [2025-01-09 16:02:01,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:02:01,051 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:02:01,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:02:01,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:02:01,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:01:59" (1/3) ... [2025-01-09 16:02:01,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f2c641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:02:01, skipping insertion in model container [2025-01-09 16:02:01,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:59" (2/3) ... [2025-01-09 16:02:01,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f2c641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:02:01, skipping insertion in model container [2025-01-09 16:02:01,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:02:01" (3/3) ... [2025-01-09 16:02:01,058 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-67.i [2025-01-09 16:02:01,069 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:02:01,070 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-67.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:02:01,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:02:01,132 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;@3b229011, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:02:01,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:02:01,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 73 states have internal predecessors, (100), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:02:01,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:02:01,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:01,147 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:01,147 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:01,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:01,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1228717728, now seen corresponding path program 1 times [2025-01-09 16:02:01,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:01,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870158575] [2025-01-09 16:02:01,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:01,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:01,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:01,166 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:02:01,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 16:02:01,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:02:01,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:02:01,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:01,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:01,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:02:01,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-09 16:02:01,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:02:01,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:01,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870158575] [2025-01-09 16:02:01,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870158575] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:01,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:01,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:02:01,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075816950] [2025-01-09 16:02:01,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:01,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:02:01,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:01,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:02:01,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:02:01,609 INFO L87 Difference]: Start difference. First operand has 87 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 73 states have internal predecessors, (100), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:02:01,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:01,634 INFO L93 Difference]: Finished difference Result 168 states and 255 transitions. [2025-01-09 16:02:01,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:02:01,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-01-09 16:02:01,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:01,643 INFO L225 Difference]: With dead ends: 168 [2025-01-09 16:02:01,644 INFO L226 Difference]: Without dead ends: 84 [2025-01-09 16:02:01,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:02:01,652 INFO L435 NwaCegarLoop]: 119 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, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:01,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:02:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-01-09 16:02:01,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-01-09 16:02:01,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 70 states have internal predecessors, (95), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:02:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2025-01-09 16:02:01,694 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 103 [2025-01-09 16:02:01,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:01,694 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2025-01-09 16:02:01,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:02:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2025-01-09 16:02:01,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:02:01,698 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:01,698 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:01,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 16:02:01,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:01,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:01,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:01,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1604504180, now seen corresponding path program 1 times [2025-01-09 16:02:01,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:01,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493416031] [2025-01-09 16:02:01,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:01,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:01,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:01,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:02:01,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 16:02:02,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:02:02,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:02:02,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:02,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:02,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:02:02,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:02:02,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:02:02,248 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:02,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493416031] [2025-01-09 16:02:02,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493416031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:02,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:02,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:02:02,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506656895] [2025-01-09 16:02:02,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:02,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:02:02,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:02,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:02:02,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:02:02,250 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:02,384 INFO L93 Difference]: Finished difference Result 172 states and 245 transitions. [2025-01-09 16:02:02,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:02:02,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-01-09 16:02:02,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:02,387 INFO L225 Difference]: With dead ends: 172 [2025-01-09 16:02:02,387 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 16:02:02,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:02:02,389 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:02,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 540 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:02:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 16:02:02,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-01-09 16:02:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 76 states have internal predecessors, (101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:02:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2025-01-09 16:02:02,397 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 103 [2025-01-09 16:02:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:02,399 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2025-01-09 16:02:02,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2025-01-09 16:02:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:02:02,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:02,401 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:02,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 16:02:02,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:02,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:02,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash 170503182, now seen corresponding path program 1 times [2025-01-09 16:02:02,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:02,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145216349] [2025-01-09 16:02:02,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:02,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:02,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:02,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:02:02,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 16:02:02,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:02:02,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:02:02,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:02,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:02,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:02:02,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:02:02,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:02:02,936 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:02,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145216349] [2025-01-09 16:02:02,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145216349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:02,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:02,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:02:02,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572218233] [2025-01-09 16:02:02,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:02,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:02:02,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:02,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:02:02,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:02:02,938 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:03,077 INFO L93 Difference]: Finished difference Result 180 states and 251 transitions. [2025-01-09 16:02:03,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:02:03,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-01-09 16:02:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:03,079 INFO L225 Difference]: With dead ends: 180 [2025-01-09 16:02:03,079 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 16:02:03,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:02:03,080 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:03,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 641 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:02:03,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 16:02:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2025-01-09 16:02:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:02:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 127 transitions. [2025-01-09 16:02:03,088 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 127 transitions. Word has length 103 [2025-01-09 16:02:03,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:03,088 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 127 transitions. [2025-01-09 16:02:03,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 127 transitions. [2025-01-09 16:02:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:02:03,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:03,090 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:03,098 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 (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:02:03,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:03,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:03,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:03,291 INFO L85 PathProgramCache]: Analyzing trace with hash 172350224, now seen corresponding path program 1 times [2025-01-09 16:02:03,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:03,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776930438] [2025-01-09 16:02:03,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:03,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:03,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:03,295 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:02:03,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 16:02:03,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:02:03,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:02:03,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:03,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:03,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 16:02:03,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:03,704 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 19 treesize of output 1 [2025-01-09 16:02:03,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2025-01-09 16:02:04,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:04,461 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 59 treesize of output 49 [2025-01-09 16:02:04,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:04,850 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 69 treesize of output 62 [2025-01-09 16:02:05,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:05,314 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 84 treesize of output 65 [2025-01-09 16:02:05,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:05,862 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 84 treesize of output 65 [2025-01-09 16:02:06,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:06,176 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 96 treesize of output 80 [2025-01-09 16:02:06,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:06,536 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 134 treesize of output 105 [2025-01-09 16:02:06,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:06,825 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 190 treesize of output 147 [2025-01-09 16:02:07,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:07,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 214 treesize of output 171 [2025-01-09 16:02:07,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:07,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 265 treesize of output 127 [2025-01-09 16:02:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 104 proven. 96 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 16:02:07,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:02:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:02:08,276 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:08,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776930438] [2025-01-09 16:02:08,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776930438] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:02:08,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:02:08,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [27] total 31 [2025-01-09 16:02:08,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776997688] [2025-01-09 16:02:08,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:08,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:02:08,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:08,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:02:08,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2025-01-09 16:02:08,278 INFO L87 Difference]: Start difference. First operand 92 states and 127 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:09,353 INFO L93 Difference]: Finished difference Result 237 states and 328 transitions. [2025-01-09 16:02:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:02:09,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-01-09 16:02:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:09,355 INFO L225 Difference]: With dead ends: 237 [2025-01-09 16:02:09,355 INFO L226 Difference]: Without dead ends: 148 [2025-01-09 16:02:09,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 16:02:09,357 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 166 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:09,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 408 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 16:02:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-09 16:02:09,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 108. [2025-01-09 16:02:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.351063829787234) internal successors, (127), 94 states have internal predecessors, (127), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:02:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 151 transitions. [2025-01-09 16:02:09,365 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 151 transitions. Word has length 103 [2025-01-09 16:02:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:09,366 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 151 transitions. [2025-01-09 16:02:09,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 151 transitions. [2025-01-09 16:02:09,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:02:09,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:09,367 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:09,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 16:02:09,568 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 16:02:09,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:09,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:09,569 INFO L85 PathProgramCache]: Analyzing trace with hash 391204942, now seen corresponding path program 1 times [2025-01-09 16:02:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:09,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248123567] [2025-01-09 16:02:09,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:09,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:09,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:09,573 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 16:02:09,574 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 16:02:09,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:02:09,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:02:09,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:09,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:09,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 16:02:09,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:02:09,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:02:09,821 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:09,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248123567] [2025-01-09 16:02:09,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248123567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:09,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:09,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:02:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565729297] [2025-01-09 16:02:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:09,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:02:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:09,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:02:09,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:02:09,822 INFO L87 Difference]: Start difference. First operand 108 states and 151 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:09,990 INFO L93 Difference]: Finished difference Result 246 states and 342 transitions. [2025-01-09 16:02:09,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:02:09,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-01-09 16:02:09,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:09,994 INFO L225 Difference]: With dead ends: 246 [2025-01-09 16:02:09,995 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 16:02:09,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:02:09,997 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 55 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:09,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 292 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:02:09,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 16:02:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 104. [2025-01-09 16:02:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 16:02:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 145 transitions. [2025-01-09 16:02:10,011 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 145 transitions. Word has length 103 [2025-01-09 16:02:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:10,011 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 145 transitions. [2025-01-09 16:02:10,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2025-01-09 16:02:10,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 16:02:10,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:10,013 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:10,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-01-09 16:02:10,221 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 16:02:10,221 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:10,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:10,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1105548322, now seen corresponding path program 1 times [2025-01-09 16:02:10,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:10,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342353552] [2025-01-09 16:02:10,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:10,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:10,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:10,224 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:02:10,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 16:02:10,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 16:02:10,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 16:02:10,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:10,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:10,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 16:02:10,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:10,529 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 19 treesize of output 1 [2025-01-09 16:02:10,573 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 26 treesize of output 25 [2025-01-09 16:02:10,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:10,685 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 41 treesize of output 28 [2025-01-09 16:02:10,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:10,824 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 41 treesize of output 28 [2025-01-09 16:02:10,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:10,904 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 37 treesize of output 28 [2025-01-09 16:02:10,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:10,928 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 43 treesize of output 39 [2025-01-09 16:02:10,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:10,979 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 83 treesize of output 73 [2025-01-09 16:02:11,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:11,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 106 [2025-01-09 16:02:11,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:11,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 151 treesize of output 61 [2025-01-09 16:02:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 141 proven. 18 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-09 16:02:11,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:02:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:02:11,534 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:11,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342353552] [2025-01-09 16:02:11,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342353552] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:02:11,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:02:11,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 15 [2025-01-09 16:02:11,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110547075] [2025-01-09 16:02:11,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:11,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:02:11,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:11,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:02:11,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:02:11,536 INFO L87 Difference]: Start difference. First operand 104 states and 145 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:12,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:12,383 INFO L93 Difference]: Finished difference Result 278 states and 386 transitions. [2025-01-09 16:02:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:02:12,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-01-09 16:02:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:12,385 INFO L225 Difference]: With dead ends: 278 [2025-01-09 16:02:12,386 INFO L226 Difference]: Without dead ends: 177 [2025-01-09 16:02:12,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:02:12,387 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 64 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:12,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 449 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:02:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-01-09 16:02:12,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2025-01-09 16:02:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 156 states have internal predecessors, (209), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:02:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 241 transitions. [2025-01-09 16:02:12,397 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 241 transitions. Word has length 105 [2025-01-09 16:02:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:12,397 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 241 transitions. [2025-01-09 16:02:12,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 241 transitions. [2025-01-09 16:02:12,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 16:02:12,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:12,399 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:12,410 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 (7)] Forceful destruction successful, exit code 0 [2025-01-09 16:02:12,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:12,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:12,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:12,601 INFO L85 PathProgramCache]: Analyzing trace with hash 747225767, now seen corresponding path program 1 times [2025-01-09 16:02:12,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:12,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572408562] [2025-01-09 16:02:12,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:12,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:12,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:12,603 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:02:12,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 16:02:12,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 16:02:12,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 16:02:12,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:12,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:12,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 16:02:12,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:12,974 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 19 treesize of output 1 [2025-01-09 16:02:13,082 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 42 treesize of output 20 [2025-01-09 16:02:13,138 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 42 treesize of output 20 [2025-01-09 16:02:13,200 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 42 treesize of output 20 [2025-01-09 16:02:13,275 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 42 treesize of output 20 [2025-01-09 16:02:13,383 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 42 treesize of output 20 [2025-01-09 16:02:13,451 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 38 treesize of output 20 [2025-01-09 16:02:13,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:13,531 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 72 treesize of output 68 [2025-01-09 16:02:13,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:13,597 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 117 treesize of output 92 [2025-01-09 16:02:13,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:13,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 126 treesize of output 113 [2025-01-09 16:02:14,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:14,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 179 treesize of output 71 [2025-01-09 16:02:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 24 proven. 60 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 16:02:14,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:02:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:02:15,437 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:15,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572408562] [2025-01-09 16:02:15,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572408562] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:02:15,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:02:15,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 22 [2025-01-09 16:02:15,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236251789] [2025-01-09 16:02:15,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:15,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:02:15,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:15,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:02:15,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:02:15,440 INFO L87 Difference]: Start difference. First operand 174 states and 241 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:16,846 INFO L93 Difference]: Finished difference Result 376 states and 518 transitions. [2025-01-09 16:02:16,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:02:16,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-01-09 16:02:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:16,850 INFO L225 Difference]: With dead ends: 376 [2025-01-09 16:02:16,850 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 16:02:16,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:02:16,851 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 183 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:16,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 372 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 16:02:16,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 16:02:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 177. [2025-01-09 16:02:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 158 states have (on average 1.3417721518987342) internal successors, (212), 159 states have internal predecessors, (212), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:02:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 244 transitions. [2025-01-09 16:02:16,866 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 244 transitions. Word has length 107 [2025-01-09 16:02:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:16,866 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 244 transitions. [2025-01-09 16:02:16,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 244 transitions. [2025-01-09 16:02:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 16:02:16,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:16,867 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:16,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 16:02:17,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:17,068 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:17,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:17,068 INFO L85 PathProgramCache]: Analyzing trace with hash -941717975, now seen corresponding path program 1 times [2025-01-09 16:02:17,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:17,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465601264] [2025-01-09 16:02:17,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:17,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:17,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:17,070 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:02:17,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-01-09 16:02:17,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 16:02:17,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 16:02:17,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:17,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:17,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 16:02:17,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:02:17,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:02:17,283 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:17,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465601264] [2025-01-09 16:02:17,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465601264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:17,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:17,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:02:17,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308649790] [2025-01-09 16:02:17,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:17,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:02:17,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:17,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:02:17,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:02:17,284 INFO L87 Difference]: Start difference. First operand 177 states and 244 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:17,301 INFO L93 Difference]: Finished difference Result 416 states and 570 transitions. [2025-01-09 16:02:17,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:02:17,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-01-09 16:02:17,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:17,303 INFO L225 Difference]: With dead ends: 416 [2025-01-09 16:02:17,303 INFO L226 Difference]: Without dead ends: 242 [2025-01-09 16:02:17,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:02:17,304 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 58 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:17,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 231 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:02:17,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-01-09 16:02:17,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 177. [2025-01-09 16:02:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 158 states have (on average 1.3291139240506329) internal successors, (210), 159 states have internal predecessors, (210), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:02:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 242 transitions. [2025-01-09 16:02:17,314 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 242 transitions. Word has length 107 [2025-01-09 16:02:17,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:17,314 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 242 transitions. [2025-01-09 16:02:17,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:17,314 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 242 transitions. [2025-01-09 16:02:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 16:02:17,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:17,316 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:17,325 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 16:02:17,516 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 16:02:17,516 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:17,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:17,517 INFO L85 PathProgramCache]: Analyzing trace with hash -902333145, now seen corresponding path program 1 times [2025-01-09 16:02:17,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:17,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167488211] [2025-01-09 16:02:17,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:17,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:17,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:17,519 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 16:02:17,520 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 16:02:17,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 16:02:17,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 16:02:17,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:17,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:17,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 16:02:17,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:17,950 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 16:02:18,207 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 16:02:18,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:18,442 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 58 treesize of output 48 [2025-01-09 16:02:18,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:18,660 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 73 treesize of output 51 [2025-01-09 16:02:18,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:18,823 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 73 treesize of output 51 [2025-01-09 16:02:19,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:19,080 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 73 treesize of output 51 [2025-01-09 16:02:19,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:19,221 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 69 treesize of output 51 [2025-01-09 16:02:19,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:19,443 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 96 treesize of output 80 [2025-01-09 16:02:19,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:19,552 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 141 treesize of output 104 [2025-01-09 16:02:19,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:19,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 150 treesize of output 125 [2025-01-09 16:02:20,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:20,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 142 treesize of output 62 [2025-01-09 16:02:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 73 proven. 78 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-09 16:02:20,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:02:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:02:20,637 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:20,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167488211] [2025-01-09 16:02:20,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167488211] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:02:20,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:02:20,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [22] total 25 [2025-01-09 16:02:20,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779156792] [2025-01-09 16:02:20,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:20,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:02:20,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:20,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:02:20,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:02:20,639 INFO L87 Difference]: Start difference. First operand 177 states and 242 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:21,471 INFO L93 Difference]: Finished difference Result 353 states and 482 transitions. [2025-01-09 16:02:21,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:02:21,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-01-09 16:02:21,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:21,473 INFO L225 Difference]: With dead ends: 353 [2025-01-09 16:02:21,473 INFO L226 Difference]: Without dead ends: 179 [2025-01-09 16:02:21,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 187 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:02:21,474 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 51 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:21,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 399 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:02:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-09 16:02:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2025-01-09 16:02:21,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 158 states have (on average 1.3227848101265822) internal successors, (209), 159 states have internal predecessors, (209), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 16:02:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 241 transitions. [2025-01-09 16:02:21,482 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 241 transitions. Word has length 107 [2025-01-09 16:02:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:21,482 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 241 transitions. [2025-01-09 16:02:21,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 241 transitions. [2025-01-09 16:02:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 16:02:21,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:21,484 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:21,495 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 16:02:21,684 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 16:02:21,685 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:21,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:21,685 INFO L85 PathProgramCache]: Analyzing trace with hash -879678361, now seen corresponding path program 1 times [2025-01-09 16:02:21,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:21,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445663997] [2025-01-09 16:02:21,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:21,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:21,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:21,688 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 16:02:21,690 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 16:02:21,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 16:02:21,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 16:02:21,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:21,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:21,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 16:02:21,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:21,957 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 76 treesize of output 75 [2025-01-09 16:02:22,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 116 [2025-01-09 16:02:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:02:22,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:02:22,459 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:22,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445663997] [2025-01-09 16:02:22,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445663997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:22,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:22,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:02:22,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961569384] [2025-01-09 16:02:22,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:22,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:02:22,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:22,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:02:22,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:02:22,461 INFO L87 Difference]: Start difference. First operand 177 states and 241 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:23,373 INFO L93 Difference]: Finished difference Result 484 states and 657 transitions. [2025-01-09 16:02:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:02:23,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-01-09 16:02:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:23,376 INFO L225 Difference]: With dead ends: 484 [2025-01-09 16:02:23,376 INFO L226 Difference]: Without dead ends: 310 [2025-01-09 16:02:23,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:02:23,377 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 75 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:23,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 287 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 16:02:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-01-09 16:02:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 218. [2025-01-09 16:02:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 185 states have (on average 1.2918918918918918) internal successors, (239), 186 states have internal predecessors, (239), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 16:02:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 295 transitions. [2025-01-09 16:02:23,393 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 295 transitions. Word has length 107 [2025-01-09 16:02:23,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:23,393 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 295 transitions. [2025-01-09 16:02:23,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:23,393 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 295 transitions. [2025-01-09 16:02:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 16:02:23,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:23,394 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:23,407 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 16:02:23,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 16:02:23,595 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:23,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:23,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1247374578, now seen corresponding path program 1 times [2025-01-09 16:02:23,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:23,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665960035] [2025-01-09 16:02:23,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:23,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:23,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:23,598 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:02:23,601 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 (12)] Waiting until timeout for monitored process [2025-01-09 16:02:23,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 16:02:23,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 16:02:23,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:23,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:23,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 16:02:23,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:23,966 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 16:02:23,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:02:23,970 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 19 treesize of output 1 [2025-01-09 16:02:23,973 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 19 treesize of output 1 [2025-01-09 16:02:23,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 16:02:23,980 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 21 treesize of output 21 [2025-01-09 16:02:24,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:24,001 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 55 [2025-01-09 16:02:24,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:24,079 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 86 treesize of output 88 [2025-01-09 16:02:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:02:24,393 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:02:24,393 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:24,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665960035] [2025-01-09 16:02:24,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665960035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:24,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:24,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:02:24,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918873858] [2025-01-09 16:02:24,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:24,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:02:24,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:24,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:02:24,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:02:24,394 INFO L87 Difference]: Start difference. First operand 218 states and 295 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:25,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:25,811 INFO L93 Difference]: Finished difference Result 455 states and 608 transitions. [2025-01-09 16:02:25,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:02:25,812 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-01-09 16:02:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:25,813 INFO L225 Difference]: With dead ends: 455 [2025-01-09 16:02:25,813 INFO L226 Difference]: Without dead ends: 281 [2025-01-09 16:02:25,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:02:25,814 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 213 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:25,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 595 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 16:02:25,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-01-09 16:02:25,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 275. [2025-01-09 16:02:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 239 states have (on average 1.2761506276150627) internal successors, (305), 241 states have internal predecessors, (305), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:02:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 365 transitions. [2025-01-09 16:02:25,834 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 365 transitions. Word has length 109 [2025-01-09 16:02:25,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:25,834 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 365 transitions. [2025-01-09 16:02:25,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 365 transitions. [2025-01-09 16:02:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 16:02:25,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:25,835 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:25,851 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 (12)] Ended with exit code 0 [2025-01-09 16:02:26,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:26,036 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:26,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:26,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1209538196, now seen corresponding path program 1 times [2025-01-09 16:02:26,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:26,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937849561] [2025-01-09 16:02:26,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:26,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:26,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:26,039 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 16:02:26,040 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 16:02:26,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 16:02:26,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 16:02:26,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:26,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:26,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 16:02:26,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:26,497 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 16:02:26,529 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 31 treesize of output 15 [2025-01-09 16:02:26,555 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 31 treesize of output 15 [2025-01-09 16:02:26,602 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 31 treesize of output 15 [2025-01-09 16:02:26,647 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 27 treesize of output 15 [2025-01-09 16:02:26,654 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 33 treesize of output 26 [2025-01-09 16:02:26,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:26,682 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 73 treesize of output 60 [2025-01-09 16:02:26,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:26,771 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 97 treesize of output 93 [2025-01-09 16:02:27,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:27,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 140 treesize of output 56 [2025-01-09 16:02:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 141 proven. 18 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-01-09 16:02:27,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:02:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-01-09 16:02:27,894 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:27,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937849561] [2025-01-09 16:02:27,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937849561] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:02:27,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:02:27,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 22 [2025-01-09 16:02:27,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150137775] [2025-01-09 16:02:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:27,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:02:27,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:27,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:02:27,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:02:27,895 INFO L87 Difference]: Start difference. First operand 275 states and 365 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:02:28,944 INFO L93 Difference]: Finished difference Result 294 states and 384 transitions. [2025-01-09 16:02:28,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:02:28,944 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-01-09 16:02:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:02:28,946 INFO L225 Difference]: With dead ends: 294 [2025-01-09 16:02:28,946 INFO L226 Difference]: Without dead ends: 292 [2025-01-09 16:02:28,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:02:28,947 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 211 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:02:28,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 484 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 16:02:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-01-09 16:02:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 245. [2025-01-09 16:02:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 212 states have (on average 1.259433962264151) internal successors, (267), 213 states have internal predecessors, (267), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-01-09 16:02:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 319 transitions. [2025-01-09 16:02:28,962 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 319 transitions. Word has length 109 [2025-01-09 16:02:28,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:02:28,963 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 319 transitions. [2025-01-09 16:02:28,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-09 16:02:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 319 transitions. [2025-01-09 16:02:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 16:02:28,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:02:28,964 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:02:28,976 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 16:02:29,164 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 16:02:29,165 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:02:29,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:02:29,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1207691154, now seen corresponding path program 1 times [2025-01-09 16:02:29,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:02:29,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624378736] [2025-01-09 16:02:29,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:02:29,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:02:29,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:02:29,167 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 16:02:29,168 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 16:02:29,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 16:02:29,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 16:02:29,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:02:29,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:02:29,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 16:02:29,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:02:29,712 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 19 treesize of output 1 [2025-01-09 16:02:29,934 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 76 treesize of output 34 [2025-01-09 16:02:29,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:29,973 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 82 treesize of output 54 [2025-01-09 16:02:30,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:30,089 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 157 treesize of output 105 [2025-01-09 16:02:31,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:31,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 181 treesize of output 138 [2025-01-09 16:02:34,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:02:34,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 338 treesize of output 122 [2025-01-09 16:02:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:02:34,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:02:34,869 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:02:34,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624378736] [2025-01-09 16:02:34,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624378736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:02:34,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:02:34,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:02:34,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217670920] [2025-01-09 16:02:34,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:02:34,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:02:34,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:02:34,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:02:34,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:02:34,870 INFO L87 Difference]: Start difference. First operand 245 states and 319 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 16:02:39,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:02:47,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:02:48,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:02:52,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]