./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.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-25.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 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:56:01,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:56:01,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:56:01,999 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:56:02,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:56:02,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:56:02,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:56:02,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:56:02,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:56:02,028 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:56:02,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:56:02,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:56:02,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:56:02,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:56:02,030 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:56:02,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:56:02,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:56:02,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:56:02,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:56:02,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:56:02,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:56:02,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:56:02,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:56:02,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:56:02,032 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:56:02,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:56:02,032 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:56:02,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:56:02,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:56:02,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:56:02,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:56:02,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:56:02,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:56:02,033 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:56:02,033 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:56:02,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:56:02,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:56:02,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:56:02,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:56:02,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:56:02,034 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:56:02,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:56:02,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:56:02,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:56:02,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:56:02,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:56:02,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:56:02,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:56:02,035 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 -> 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 [2025-01-09 15:56:02,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:56:02,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:56:02,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:56:02,308 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:56:02,308 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:56:02,310 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-25.i [2025-01-09 15:56:03,579 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6feebe41e/2eb79e8fa5ec4862914d5628db49b9a8/FLAG780cca964 [2025-01-09 15:56:03,872 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:56:03,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i [2025-01-09 15:56:03,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6feebe41e/2eb79e8fa5ec4862914d5628db49b9a8/FLAG780cca964 [2025-01-09 15:56:04,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6feebe41e/2eb79e8fa5ec4862914d5628db49b9a8 [2025-01-09 15:56:04,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:56:04,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:56:04,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:56:04,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:56:04,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:56:04,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:56:04" (1/1) ... [2025-01-09 15:56:04,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e30971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04, skipping insertion in model container [2025-01-09 15:56:04,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:56:04" (1/1) ... [2025-01-09 15:56:04,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:56:04,302 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-25.i[916,929] [2025-01-09 15:56:04,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:56:04,378 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:56:04,386 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-25.i[916,929] [2025-01-09 15:56:04,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:56:04,442 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:56:04,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04 WrapperNode [2025-01-09 15:56:04,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:56:04,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:56:04,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:56:04,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:56:04,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04" (1/1) ... [2025-01-09 15:56:04,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04" (1/1) ... [2025-01-09 15:56:04,509 INFO L138 Inliner]: procedures = 30, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 551 [2025-01-09 15:56:04,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:56:04,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:56:04,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:56:04,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:56:04,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04" (1/1) ... [2025-01-09 15:56:04,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04" (1/1) ... [2025-01-09 15:56:04,522 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04" (1/1) ... [2025-01-09 15:56:04,527 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 15:56:04,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04" (1/1) ... [2025-01-09 15:56:04,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04" (1/1) ... [2025-01-09 15:56:04,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04" (1/1) ... [2025-01-09 15:56:04,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04" (1/1) ... [2025-01-09 15:56:04,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04" (1/1) ... [2025-01-09 15:56:04,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04" (1/1) ... [2025-01-09 15:56:04,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04" (1/1) ... [2025-01-09 15:56:04,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:56:04,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:56:04,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:56:04,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:56:04,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04" (1/1) ... [2025-01-09 15:56:04,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:56:04,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:56:04,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:56:04,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:56:04,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:56:04,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 15:56:04,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 15:56:04,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 15:56:04,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 15:56:04,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 15:56:04,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 15:56:04,629 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:56:04,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:56:04,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 15:56:04,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:56:04,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:56:04,744 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:56:04,746 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:56:05,453 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2025-01-09 15:56:05,454 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:56:05,466 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:56:05,466 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:56:05,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:56:05 BoogieIcfgContainer [2025-01-09 15:56:05,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:56:05,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:56:05,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:56:05,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:56:05,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:56:04" (1/3) ... [2025-01-09 15:56:05,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415ccd71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:56:05, skipping insertion in model container [2025-01-09 15:56:05,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:04" (2/3) ... [2025-01-09 15:56:05,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415ccd71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:56:05, skipping insertion in model container [2025-01-09 15:56:05,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:56:05" (3/3) ... [2025-01-09 15:56:05,476 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-25.i [2025-01-09 15:56:05,486 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:56:05,487 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-25.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:56:05,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:56:05,545 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;@75c674a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:56:05,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:56:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:56:05,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:56:05,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:05,560 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:05,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:05,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:05,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1936540260, now seen corresponding path program 1 times [2025-01-09 15:56:05,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:05,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878191188] [2025-01-09 15:56:05,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:05,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:05,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:56:05,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:56:05,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:05,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 15:56:05,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:05,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878191188] [2025-01-09 15:56:05,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878191188] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:56:05,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522332751] [2025-01-09 15:56:05,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:05,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:56:05,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:56:05,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:56:05,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:56:06,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:56:06,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:56:06,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:06,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:06,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:56:06,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 15:56:06,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:06,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522332751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:06,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:56:06,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:56:06,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179093725] [2025-01-09 15:56:06,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:06,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:56:06,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:06,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:56:06,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:56:06,327 INFO L87 Difference]: Start difference. First operand has 123 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:06,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:06,349 INFO L93 Difference]: Finished difference Result 240 states and 375 transitions. [2025-01-09 15:56:06,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:56:06,351 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-01-09 15:56:06,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:06,356 INFO L225 Difference]: With dead ends: 240 [2025-01-09 15:56:06,357 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 15:56:06,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:56:06,362 INFO L435 NwaCegarLoop]: 176 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, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:06,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:56:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 15:56:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 15:56:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:56:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-01-09 15:56:06,401 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 144 [2025-01-09 15:56:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:06,402 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-01-09 15:56:06,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-01-09 15:56:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:56:06,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:06,406 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:06,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:56:06,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:56:06,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:06,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash 451840708, now seen corresponding path program 1 times [2025-01-09 15:56:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:06,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328639347] [2025-01-09 15:56:06,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:06,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:06,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:56:06,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:56:06,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:06,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:56:08,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:08,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328639347] [2025-01-09 15:56:08,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328639347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:08,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:08,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:56:08,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107793495] [2025-01-09 15:56:08,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:08,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:56:08,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:08,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:56:08,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:56:08,373 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:08,919 INFO L93 Difference]: Finished difference Result 315 states and 461 transitions. [2025-01-09 15:56:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:56:08,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-01-09 15:56:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:08,922 INFO L225 Difference]: With dead ends: 315 [2025-01-09 15:56:08,922 INFO L226 Difference]: Without dead ends: 198 [2025-01-09 15:56:08,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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 15:56:08,924 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 102 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:08,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 492 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:56:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-09 15:56:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2025-01-09 15:56:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 164 states have (on average 1.396341463414634) internal successors, (229), 165 states have internal predecessors, (229), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:56:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 285 transitions. [2025-01-09 15:56:08,945 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 285 transitions. Word has length 144 [2025-01-09 15:56:08,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:08,946 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 285 transitions. [2025-01-09 15:56:08,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 285 transitions. [2025-01-09 15:56:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:56:08,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:08,952 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:08,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:56:08,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:08,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:08,954 INFO L85 PathProgramCache]: Analyzing trace with hash -769679731, now seen corresponding path program 1 times [2025-01-09 15:56:08,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:08,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907144790] [2025-01-09 15:56:08,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:08,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:09,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:56:09,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:56:09,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:09,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:56:10,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:10,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907144790] [2025-01-09 15:56:10,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907144790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:10,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:10,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:56:10,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471408981] [2025-01-09 15:56:10,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:10,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:10,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:10,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:10,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:10,740 INFO L87 Difference]: Start difference. First operand 195 states and 285 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:11,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:11,629 INFO L93 Difference]: Finished difference Result 392 states and 572 transitions. [2025-01-09 15:56:11,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:56:11,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-01-09 15:56:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:11,635 INFO L225 Difference]: With dead ends: 392 [2025-01-09 15:56:11,635 INFO L226 Difference]: Without dead ends: 200 [2025-01-09 15:56:11,636 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 15:56:11,636 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 96 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:11,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 769 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:56:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-09 15:56:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2025-01-09 15:56:11,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 166 states have (on average 1.391566265060241) internal successors, (231), 167 states have internal predecessors, (231), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:56:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 287 transitions. [2025-01-09 15:56:11,667 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 287 transitions. Word has length 144 [2025-01-09 15:56:11,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:11,668 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 287 transitions. [2025-01-09 15:56:11,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 287 transitions. [2025-01-09 15:56:11,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:56:11,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:11,670 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:11,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:56:11,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:11,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:11,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1662654850, now seen corresponding path program 1 times [2025-01-09 15:56:11,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:11,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923080208] [2025-01-09 15:56:11,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:11,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:11,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:56:11,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:56:11,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:11,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:56:12,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:12,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923080208] [2025-01-09 15:56:12,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923080208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:12,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:12,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:56:12,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928770346] [2025-01-09 15:56:12,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:12,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:56:12,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:12,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:56:12,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:12,374 INFO L87 Difference]: Start difference. First operand 197 states and 287 transitions. Second operand has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:56:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:13,241 INFO L93 Difference]: Finished difference Result 430 states and 626 transitions. [2025-01-09 15:56:13,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:56:13,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-01-09 15:56:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:13,246 INFO L225 Difference]: With dead ends: 430 [2025-01-09 15:56:13,246 INFO L226 Difference]: Without dead ends: 236 [2025-01-09 15:56:13,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 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 15:56:13,249 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 143 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:13,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 671 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:56:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-09 15:56:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 227. [2025-01-09 15:56:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 187 states have (on average 1.374331550802139) internal successors, (257), 188 states have internal predecessors, (257), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:56:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 329 transitions. [2025-01-09 15:56:13,287 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 329 transitions. Word has length 145 [2025-01-09 15:56:13,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:13,288 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 329 transitions. [2025-01-09 15:56:13,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.6) internal successors, (58), 7 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:56:13,288 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 329 transitions. [2025-01-09 15:56:13,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 15:56:13,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:13,293 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:13,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:56:13,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:13,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:13,294 INFO L85 PathProgramCache]: Analyzing trace with hash -458659009, now seen corresponding path program 1 times [2025-01-09 15:56:13,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:13,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746433608] [2025-01-09 15:56:13,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:13,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:13,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 15:56:13,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 15:56:13,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:13,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:56:13,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:13,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746433608] [2025-01-09 15:56:13,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746433608] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:56:13,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722979326] [2025-01-09 15:56:13,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:13,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:56:13,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:56:13,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:56:13,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:56:13,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 15:56:13,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 15:56:13,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:13,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:13,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:56:13,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:13,840 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:56:13,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:13,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722979326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:13,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:56:13,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-01-09 15:56:13,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759152213] [2025-01-09 15:56:13,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:13,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:56:13,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:13,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:56:13,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:56:13,842 INFO L87 Difference]: Start difference. First operand 227 states and 329 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:56:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:13,894 INFO L93 Difference]: Finished difference Result 457 states and 663 transitions. [2025-01-09 15:56:13,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:56:13,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2025-01-09 15:56:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:13,898 INFO L225 Difference]: With dead ends: 457 [2025-01-09 15:56:13,899 INFO L226 Difference]: Without dead ends: 233 [2025-01-09 15:56:13,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:56:13,900 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:13,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 682 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:56:13,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-01-09 15:56:13,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2025-01-09 15:56:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 191 states have (on average 1.3664921465968587) internal successors, (261), 192 states have internal predecessors, (261), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:56:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 333 transitions. [2025-01-09 15:56:13,930 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 333 transitions. Word has length 146 [2025-01-09 15:56:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:13,931 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 333 transitions. [2025-01-09 15:56:13,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:56:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 333 transitions. [2025-01-09 15:56:13,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:56:13,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:13,934 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:13,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:56:14,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:56:14,135 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:14,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash -270817756, now seen corresponding path program 1 times [2025-01-09 15:56:14,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:14,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103622150] [2025-01-09 15:56:14,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:14,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:14,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:56:14,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:56:14,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:14,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:56:14,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:14,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103622150] [2025-01-09 15:56:14,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103622150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:14,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:14,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:56:14,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883619309] [2025-01-09 15:56:14,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:14,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:14,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:14,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:14,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:14,840 INFO L87 Difference]: Start difference. First operand 231 states and 333 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:15,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:15,482 INFO L93 Difference]: Finished difference Result 461 states and 665 transitions. [2025-01-09 15:56:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:56:15,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2025-01-09 15:56:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:15,485 INFO L225 Difference]: With dead ends: 461 [2025-01-09 15:56:15,485 INFO L226 Difference]: Without dead ends: 233 [2025-01-09 15:56:15,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:56:15,487 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 129 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:15,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 654 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:56:15,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-01-09 15:56:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 224. [2025-01-09 15:56:15,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 184 states have (on average 1.358695652173913) internal successors, (250), 185 states have internal predecessors, (250), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:56:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 322 transitions. [2025-01-09 15:56:15,518 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 322 transitions. Word has length 148 [2025-01-09 15:56:15,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:15,519 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 322 transitions. [2025-01-09 15:56:15,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 322 transitions. [2025-01-09 15:56:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:56:15,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:15,521 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:15,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:56:15,522 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:15,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:15,523 INFO L85 PathProgramCache]: Analyzing trace with hash -37454940, now seen corresponding path program 1 times [2025-01-09 15:56:15,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:15,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032973038] [2025-01-09 15:56:15,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:15,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:15,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:56:15,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:56:15,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:15,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:56:16,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:16,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032973038] [2025-01-09 15:56:16,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032973038] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:56:16,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270598898] [2025-01-09 15:56:16,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:16,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:56:16,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:56:16,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:56:16,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:56:16,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:56:16,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:56:16,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:16,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:16,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 15:56:16,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:16,430 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 15:56:16,498 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 15:56:16,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:16,548 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 46 treesize of output 45 [2025-01-09 15:56:16,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:16,626 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 61 treesize of output 48 [2025-01-09 15:56:16,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:16,701 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 61 treesize of output 48 [2025-01-09 15:56:16,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:16,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 17 [2025-01-09 15:56:16,747 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 113 proven. 3 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 15:56:16,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:56:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:56:17,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270598898] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:56:17,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:56:17,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 17 [2025-01-09 15:56:17,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659904050] [2025-01-09 15:56:17,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:56:17,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:56:17,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:17,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:56:17,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:56:17,067 INFO L87 Difference]: Start difference. First operand 224 states and 322 transitions. Second operand has 17 states, 13 states have (on average 9.615384615384615) internal successors, (125), 17 states have internal predecessors, (125), 7 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 3 states have call predecessors, (38), 7 states have call successors, (38) [2025-01-09 15:56:18,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:18,783 INFO L93 Difference]: Finished difference Result 589 states and 836 transitions. [2025-01-09 15:56:18,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 15:56:18,785 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 9.615384615384615) internal successors, (125), 17 states have internal predecessors, (125), 7 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 3 states have call predecessors, (38), 7 states have call successors, (38) Word has length 148 [2025-01-09 15:56:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:18,788 INFO L225 Difference]: With dead ends: 589 [2025-01-09 15:56:18,788 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 15:56:18,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 285 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1233, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 15:56:18,791 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 911 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:18,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 581 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 15:56:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 15:56:18,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 351. [2025-01-09 15:56:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 288 states have (on average 1.3472222222222223) internal successors, (388), 290 states have internal predecessors, (388), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:56:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 496 transitions. [2025-01-09 15:56:18,826 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 496 transitions. Word has length 148 [2025-01-09 15:56:18,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:18,826 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 496 transitions. [2025-01-09 15:56:18,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 9.615384615384615) internal successors, (125), 17 states have internal predecessors, (125), 7 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 3 states have call predecessors, (38), 7 states have call successors, (38) [2025-01-09 15:56:18,827 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 496 transitions. [2025-01-09 15:56:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:56:18,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:18,830 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:18,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:56:19,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:56:19,035 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:19,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:19,036 INFO L85 PathProgramCache]: Analyzing trace with hash -580219499, now seen corresponding path program 1 times [2025-01-09 15:56:19,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:19,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654982645] [2025-01-09 15:56:19,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:19,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:19,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:56:19,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:56:19,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:19,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:56:19,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:19,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654982645] [2025-01-09 15:56:19,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654982645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:19,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:19,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:56:19,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160625305] [2025-01-09 15:56:19,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:19,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:56:19,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:19,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:56:19,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:56:19,627 INFO L87 Difference]: Start difference. First operand 351 states and 496 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:56:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:20,245 INFO L93 Difference]: Finished difference Result 821 states and 1160 transitions. [2025-01-09 15:56:20,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:56:20,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-01-09 15:56:20,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:20,249 INFO L225 Difference]: With dead ends: 821 [2025-01-09 15:56:20,252 INFO L226 Difference]: Without dead ends: 473 [2025-01-09 15:56:20,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:20,254 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 86 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:20,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 429 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:56:20,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-01-09 15:56:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 469. [2025-01-09 15:56:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 400 states have (on average 1.365) internal successors, (546), 404 states have internal predecessors, (546), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:56:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 662 transitions. [2025-01-09 15:56:20,303 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 662 transitions. Word has length 149 [2025-01-09 15:56:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:20,305 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 662 transitions. [2025-01-09 15:56:20,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:56:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 662 transitions. [2025-01-09 15:56:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:56:20,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:20,309 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:20,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:56:20,309 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:20,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:20,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1379438969, now seen corresponding path program 1 times [2025-01-09 15:56:20,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:20,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731395841] [2025-01-09 15:56:20,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:20,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:20,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:56:20,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:56:20,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:20,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:56:22,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:56:22,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731395841] [2025-01-09 15:56:22,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731395841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:22,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:22,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:56:22,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407264168] [2025-01-09 15:56:22,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:22,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:56:22,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:56:22,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:56:22,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:56:22,093 INFO L87 Difference]: Start difference. First operand 469 states and 662 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:22,874 INFO L93 Difference]: Finished difference Result 1327 states and 1863 transitions. [2025-01-09 15:56:22,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:56:22,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2025-01-09 15:56:22,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:22,879 INFO L225 Difference]: With dead ends: 1327 [2025-01-09 15:56:22,880 INFO L226 Difference]: Without dead ends: 861 [2025-01-09 15:56:22,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:56:22,882 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 241 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:22,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 433 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:56:22,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-01-09 15:56:22,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 851. [2025-01-09 15:56:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 713 states have (on average 1.3464235624123422) internal successors, (960), 721 states have internal predecessors, (960), 116 states have call successors, (116), 21 states have call predecessors, (116), 21 states have return successors, (116), 108 states have call predecessors, (116), 116 states have call successors, (116) [2025-01-09 15:56:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1192 transitions. [2025-01-09 15:56:22,962 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1192 transitions. Word has length 151 [2025-01-09 15:56:22,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:22,963 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1192 transitions. [2025-01-09 15:56:22,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1192 transitions. [2025-01-09 15:56:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:56:22,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:22,965 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:22,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:56:22,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:22,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash -979009090, now seen corresponding path program 1 times [2025-01-09 15:56:22,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:56:22,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228982382] [2025-01-09 15:56:22,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:56:22,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:56:23,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:56:23,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:23,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:56:23,067 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:56:23,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:56:23,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:56:23,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:23,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:56:23,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:56:23,184 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:56:23,185 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:56:23,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:56:23,188 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:23,253 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:56:23,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:56:23 BoogieIcfgContainer [2025-01-09 15:56:23,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:56:23,259 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:56:23,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:56:23,259 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:56:23,259 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:56:05" (3/4) ... [2025-01-09 15:56:23,261 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:56:23,262 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:56:23,263 INFO L158 Benchmark]: Toolchain (without parser) took 19113.87ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 112.4MB in the beginning and 189.2MB in the end (delta: -76.9MB). Peak memory consumption was 262.4MB. Max. memory is 16.1GB. [2025-01-09 15:56:23,263 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:56:23,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.38ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 95.4MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:56:23,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.99ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 91.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:56:23,264 INFO L158 Benchmark]: Boogie Preprocessor took 63.67ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 87.9MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:56:23,264 INFO L158 Benchmark]: RCFGBuilder took 892.94ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 53.4MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:56:23,265 INFO L158 Benchmark]: TraceAbstraction took 17788.77ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 52.5MB in the beginning and 189.3MB in the end (delta: -136.8MB). Peak memory consumption was 195.3MB. Max. memory is 16.1GB. [2025-01-09 15:56:23,265 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 478.2MB. Free memory was 189.3MB in the beginning and 189.2MB in the end (delta: 78.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:56:23,266 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.28ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.38ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 95.4MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.99ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 91.3MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.67ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 87.9MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 892.94ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 53.4MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17788.77ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 52.5MB in the beginning and 189.3MB in the end (delta: -136.8MB). Peak memory consumption was 195.3MB. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 478.2MB. Free memory was 189.3MB in the beginning and 189.2MB in the end (delta: 78.1kB). Peak memory consumption was 8.4MB. 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 109, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 79. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 256, 0, 10, 500, 0, 1509114200, 10, 128.9, 63.363, 4.575, 25.5, 1, 0, 1 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L126] isInitial = 1 [L127] FCALL initially() [L129] FCALL updateLastVariables() [L130] CALL updateVariables() [L90] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ushort() [L94] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L97] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ulong() [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ulong() [L106] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_9 [L109] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L109] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_10 [L111] EXPR WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] RET updateVariables() [L131] CALL step() [L58] EXPR WrapperStruct00.var_1_9 [L58] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L58] COND FALSE !(WrapperStruct00.var_1_9 != WrapperStruct00.var_1_10) [L65] EXPR WrapperStruct00.var_1_14 [L65] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_14 [L67] EXPR WrapperStruct00.var_1_3 [L67] unsigned short int stepLocal_0 = WrapperStruct00.var_1_3; [L68] WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=65538] [L68] COND TRUE WrapperStruct00.var_1_12 [L69] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=65538] [L69] COND FALSE !(stepLocal_0 <= WrapperStruct00.var_1_4) [L75] EXPR WrapperStruct00.var_1_1 [L75] unsigned long int stepLocal_1 = WrapperStruct00.var_1_1; [L76] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=256] [L76] COND FALSE !(WrapperStruct00.var_1_7 >= stepLocal_1) [L79] EXPR WrapperStruct00.var_1_9 [L79] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) [L79] EXPR WrapperStruct00.var_1_9 [L79] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1] [L79] WrapperStruct00.var_1_8 = ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))) [L81] EXPR WrapperStruct00.var_1_10 [L81] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR ((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9) [L81] EXPR WrapperStruct00.var_1_9 [L81] EXPR ((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L81] EXPR ((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8) [L81] EXPR WrapperStruct00.var_1_8 [L81] EXPR ((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] COND TRUE WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8))) [L82] EXPR WrapperStruct00.var_1_10 [L82] WrapperStruct00.var_1_11 = WrapperStruct00.var_1_10 [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7)) [L122] EXPR WrapperStruct00.var_1_3 [L122] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) [L122] EXPR WrapperStruct00.var_1_7 [L122] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) [L122] EXPR WrapperStruct00.var_1_8 [L122] EXPR WrapperStruct00.var_1_9 [L122] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) [L122] EXPR WrapperStruct00.var_1_9 [L122] EXPR ((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10)))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR ((WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_10)) : ((! (WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_9)) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR (((WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_10)) : ((! (WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_9)) : 1))) && ((WrapperStruct00.var_1_9 != WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1] [L122-L123] return (((WrapperStruct00.var_1_12 ? ((WrapperStruct00.var_1_3 <= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_1 == ((unsigned long int) (((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5)))) + (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)))) : 1) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_7))) && ((WrapperStruct00.var_1_7 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_8 == ((float) ((((0.5f) < (WrapperStruct00.var_1_9)) ? (0.5f) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_8 == ((float) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_10))))))) && ((WrapperStruct00.var_1_10 >= ((((((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) < (WrapperStruct00.var_1_8)) ? (((((128.175f) > (WrapperStruct00.var_1_9)) ? (128.175f) : (WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_10)) : ((! (WrapperStruct00.var_1_7 <= WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_11 == ((float) WrapperStruct00.var_1_9)) : 1))) && ((WrapperStruct00.var_1_9 != WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_2 || WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_13 || WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14))) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.7s, OverallIterations: 10, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1715 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1708 mSDsluCounter, 4887 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3522 mSDsCounter, 431 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4108 IncrementalHoareTripleChecker+Invalid, 4539 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 431 mSolverCounterUnsat, 1365 mSDtfsCounter, 4108 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 726 GetRequests, 638 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=851occurred in iteration=9, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 57 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1908 NumberOfCodeBlocks, 1908 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1892 ConstructedInterpolants, 0 QuantifiedInterpolants, 4850 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1548 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 7862/7956 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:56:23,286 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-25.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 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:56:25,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:56:25,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:56:25,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:56:25,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:56:25,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:56:25,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:56:25,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:56:25,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:56:25,578 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:56:25,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:56:25,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:56:25,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:56:25,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:56:25,579 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:56:25,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:56:25,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:56:25,579 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:56:25,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:56:25,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:56:25,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:56:25,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:56:25,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:56:25,579 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:56:25,579 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:56:25,579 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:56:25,580 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:56:25,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:56:25,580 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:56:25,580 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:56:25,580 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:56:25,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:56:25,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:56:25,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:56:25,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:56:25,580 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:56:25,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:56:25,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:56:25,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:56:25,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:56:25,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:56:25,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:56:25,583 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:56:25,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:56:25,584 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:56:25,584 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:56:25,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:56:25,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:56:25,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:56:25,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:56:25,585 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 -> 7e44eca549ad63e100ff6b29db4a1cf439ea9f40f98c1b07aaed555a9a1c91f0 [2025-01-09 15:56:25,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:56:25,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:56:25,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:56:25,890 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:56:25,890 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:56:25,891 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-25.i [2025-01-09 15:56:27,179 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d5696a04/0bc3a05eb4a54f819e9fe93ef0b0c867/FLAG6add30aaa [2025-01-09 15:56:27,416 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:56:27,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-25.i [2025-01-09 15:56:27,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d5696a04/0bc3a05eb4a54f819e9fe93ef0b0c867/FLAG6add30aaa [2025-01-09 15:56:27,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d5696a04/0bc3a05eb4a54f819e9fe93ef0b0c867 [2025-01-09 15:56:27,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:56:27,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:56:27,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:56:27,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:56:27,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:56:27,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:56:27" (1/1) ... [2025-01-09 15:56:27,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab4b8ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27, skipping insertion in model container [2025-01-09 15:56:27,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:56:27" (1/1) ... [2025-01-09 15:56:27,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:56:27,607 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-25.i[916,929] [2025-01-09 15:56:27,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:56:27,691 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:56:27,702 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-25.i[916,929] [2025-01-09 15:56:27,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:56:27,771 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:56:27,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27 WrapperNode [2025-01-09 15:56:27,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:56:27,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:56:27,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:56:27,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:56:27,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27" (1/1) ... [2025-01-09 15:56:27,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27" (1/1) ... [2025-01-09 15:56:27,839 INFO L138 Inliner]: procedures = 37, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 550 [2025-01-09 15:56:27,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:56:27,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:56:27,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:56:27,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:56:27,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27" (1/1) ... [2025-01-09 15:56:27,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27" (1/1) ... [2025-01-09 15:56:27,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27" (1/1) ... [2025-01-09 15:56:27,876 INFO L175 MemorySlicer]: Split 147 memory accesses to 2 slices as follows [2, 145]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2025-01-09 15:56:27,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27" (1/1) ... [2025-01-09 15:56:27,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27" (1/1) ... [2025-01-09 15:56:27,906 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27" (1/1) ... [2025-01-09 15:56:27,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27" (1/1) ... [2025-01-09 15:56:27,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27" (1/1) ... [2025-01-09 15:56:27,914 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27" (1/1) ... [2025-01-09 15:56:27,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27" (1/1) ... [2025-01-09 15:56:27,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:56:27,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:56:27,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:56:27,931 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:56:27,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27" (1/1) ... [2025-01-09 15:56:27,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:56:27,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:56:27,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:56:27,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:56:27,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:56:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:56:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:56:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:56:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:56:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:56:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:56:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:56:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:56:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:56:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:56:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 15:56:27,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 15:56:27,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:56:27,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:56:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 15:56:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 15:56:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 15:56:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 15:56:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:56:27,989 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:56:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-01-09 15:56:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-01-09 15:56:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:56:27,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:56:27,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:56:27,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:56:27,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:56:27,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:56:27,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:56:27,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:56:28,122 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:56:28,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:56:28,997 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2025-01-09 15:56:28,997 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:56:29,011 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:56:29,012 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:56:29,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:56:29 BoogieIcfgContainer [2025-01-09 15:56:29,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:56:29,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:56:29,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:56:29,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:56:29,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:56:27" (1/3) ... [2025-01-09 15:56:29,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d7dd1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:56:29, skipping insertion in model container [2025-01-09 15:56:29,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:27" (2/3) ... [2025-01-09 15:56:29,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d7dd1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:56:29, skipping insertion in model container [2025-01-09 15:56:29,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:56:29" (3/3) ... [2025-01-09 15:56:29,022 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-25.i [2025-01-09 15:56:29,036 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:56:29,037 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-25.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:56:29,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:56:29,097 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;@5f0a3c5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:56:29,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:56:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:56:29,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:56:29,112 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:29,113 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:29,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:29,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:29,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1670388017, now seen corresponding path program 1 times [2025-01-09 15:56:29,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:29,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492922212] [2025-01-09 15:56:29,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:29,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:29,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:29,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:56:29,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:56:29,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:56:29,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:56:29,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:29,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:29,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:56:29,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-09 15:56:29,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:29,610 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:56:29,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492922212] [2025-01-09 15:56:29,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492922212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:29,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:29,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:56:29,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039804639] [2025-01-09 15:56:29,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:29,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:56:29,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:56:29,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:56:29,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:56:29,632 INFO L87 Difference]: Start difference. First operand has 123 states, 102 states have (on average 1.4215686274509804) internal successors, (145), 103 states have internal predecessors, (145), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:29,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:29,666 INFO L93 Difference]: Finished difference Result 240 states and 375 transitions. [2025-01-09 15:56:29,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:56:29,668 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-01-09 15:56:29,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:29,674 INFO L225 Difference]: With dead ends: 240 [2025-01-09 15:56:29,674 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 15:56:29,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:56:29,680 INFO L435 NwaCegarLoop]: 176 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, 176 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:29,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:56:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 15:56:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 15:56:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:56:29,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 176 transitions. [2025-01-09 15:56:29,718 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 176 transitions. Word has length 144 [2025-01-09 15:56:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:29,718 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 176 transitions. [2025-01-09 15:56:29,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 176 transitions. [2025-01-09 15:56:29,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:56:29,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:29,721 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:29,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:56:29,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:29,922 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:29,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:29,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1139879727, now seen corresponding path program 1 times [2025-01-09 15:56:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:29,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688099690] [2025-01-09 15:56:29,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:29,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:29,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:29,927 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:56:29,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:56:30,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:56:30,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:56:30,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:30,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:30,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:56:30,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:30,560 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 44 treesize of output 31 [2025-01-09 15:56:30,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:30,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 20 [2025-01-09 15:56:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 15:56:30,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:30,700 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:56:30,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688099690] [2025-01-09 15:56:30,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688099690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:30,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:30,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:56:30,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966202848] [2025-01-09 15:56:30,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:30,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:56:30,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:56:30,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:56:30,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:56:30,703 INFO L87 Difference]: Start difference. First operand 120 states and 176 transitions. Second operand has 12 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:56:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:33,116 INFO L93 Difference]: Finished difference Result 356 states and 516 transitions. [2025-01-09 15:56:33,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 15:56:33,119 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2025-01-09 15:56:33,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:33,122 INFO L225 Difference]: With dead ends: 356 [2025-01-09 15:56:33,122 INFO L226 Difference]: Without dead ends: 239 [2025-01-09 15:56:33,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:56:33,126 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 266 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:33,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 462 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 15:56:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-09 15:56:33,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 130. [2025-01-09 15:56:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:56:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 184 transitions. [2025-01-09 15:56:33,158 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 184 transitions. Word has length 144 [2025-01-09 15:56:33,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:33,161 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 184 transitions. [2025-01-09 15:56:33,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:56:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 184 transitions. [2025-01-09 15:56:33,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:56:33,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:33,163 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:33,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 15:56:33,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:33,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:33,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash -89686479, now seen corresponding path program 1 times [2025-01-09 15:56:33,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:33,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976087987] [2025-01-09 15:56:33,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:33,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:33,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:33,369 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:56:33,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 15:56:33,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:56:33,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:56:33,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:33,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:33,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:56:33,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:33,956 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 44 treesize of output 31 [2025-01-09 15:56:34,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:34,067 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 34 [2025-01-09 15:56:34,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:34,140 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 34 [2025-01-09 15:56:34,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:34,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 20 [2025-01-09 15:56:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 15:56:34,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:34,198 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:56:34,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976087987] [2025-01-09 15:56:34,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976087987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:34,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:34,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:56:34,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184102504] [2025-01-09 15:56:34,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:34,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:56:34,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:56:34,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:56:34,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:56:34,201 INFO L87 Difference]: Start difference. First operand 130 states and 184 transitions. Second operand has 12 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:56:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:36,298 INFO L93 Difference]: Finished difference Result 366 states and 523 transitions. [2025-01-09 15:56:36,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 15:56:36,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-01-09 15:56:36,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:36,302 INFO L225 Difference]: With dead ends: 366 [2025-01-09 15:56:36,302 INFO L226 Difference]: Without dead ends: 239 [2025-01-09 15:56:36,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:56:36,304 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 462 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:36,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 456 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 15:56:36,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-09 15:56:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 149. [2025-01-09 15:56:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:56:36,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 213 transitions. [2025-01-09 15:56:36,334 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 213 transitions. Word has length 145 [2025-01-09 15:56:36,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:36,335 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 213 transitions. [2025-01-09 15:56:36,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:56:36,335 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 213 transitions. [2025-01-09 15:56:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:56:36,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:36,341 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:36,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 15:56:36,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:36,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:36,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:36,542 INFO L85 PathProgramCache]: Analyzing trace with hash 179827427, now seen corresponding path program 1 times [2025-01-09 15:56:36,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:36,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980183916] [2025-01-09 15:56:36,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:36,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:36,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:36,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:56:36,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 15:56:36,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:56:36,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:56:36,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:36,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:36,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:56:36,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:56:36,865 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:36,865 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:56:36,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980183916] [2025-01-09 15:56:36,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980183916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:36,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:36,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:56:36,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461984823] [2025-01-09 15:56:36,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:36,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:56:36,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:56:36,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:56:36,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:56:36,867 INFO L87 Difference]: Start difference. First operand 149 states and 213 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:56:36,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:36,908 INFO L93 Difference]: Finished difference Result 298 states and 427 transitions. [2025-01-09 15:56:36,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:56:36,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-01-09 15:56:36,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:36,912 INFO L225 Difference]: With dead ends: 298 [2025-01-09 15:56:36,912 INFO L226 Difference]: Without dead ends: 152 [2025-01-09 15:56:36,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:56:36,915 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:36,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 677 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:56:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-01-09 15:56:36,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-01-09 15:56:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:56:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 216 transitions. [2025-01-09 15:56:36,935 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 216 transitions. Word has length 147 [2025-01-09 15:56:36,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:36,937 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 216 transitions. [2025-01-09 15:56:36,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:56:36,937 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2025-01-09 15:56:36,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:56:36,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:36,942 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:36,952 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 (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:56:37,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:37,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:37,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:37,143 INFO L85 PathProgramCache]: Analyzing trace with hash 360186748, now seen corresponding path program 1 times [2025-01-09 15:56:37,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:37,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071533053] [2025-01-09 15:56:37,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:37,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:37,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:37,148 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:56:37,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 15:56:37,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:56:37,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:56:37,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:37,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:37,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 15:56:37,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:37,642 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 37 treesize of output 30 [2025-01-09 15:56:37,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:37,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2025-01-09 15:56:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 15:56:37,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:37,719 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:56:37,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071533053] [2025-01-09 15:56:37,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071533053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:37,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:37,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:56:37,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995133357] [2025-01-09 15:56:37,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:37,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:56:37,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:56:37,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:56:37,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:56:37,721 INFO L87 Difference]: Start difference. First operand 152 states and 216 transitions. Second operand has 13 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:56:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:39,100 INFO L93 Difference]: Finished difference Result 303 states and 431 transitions. [2025-01-09 15:56:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:56:39,101 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2025-01-09 15:56:39,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:39,102 INFO L225 Difference]: With dead ends: 303 [2025-01-09 15:56:39,102 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 15:56:39,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:56:39,104 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 135 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:39,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 412 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 15:56:39,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 15:56:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2025-01-09 15:56:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 130 states have (on average 1.376923076923077) internal successors, (179), 130 states have internal predecessors, (179), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:56:39,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 215 transitions. [2025-01-09 15:56:39,116 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 215 transitions. Word has length 148 [2025-01-09 15:56:39,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:39,117 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 215 transitions. [2025-01-09 15:56:39,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.090909090909091) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:56:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 215 transitions. [2025-01-09 15:56:39,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:56:39,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:39,119 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:39,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 15:56:39,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:39,319 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:39,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1509634948, now seen corresponding path program 1 times [2025-01-09 15:56:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:39,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286518735] [2025-01-09 15:56:39,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:39,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:39,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:39,322 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:56:39,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 15:56:39,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:56:39,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:56:39,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:39,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:39,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 15:56:39,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:39,913 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 37 treesize of output 30 [2025-01-09 15:56:40,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:40,037 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 52 treesize of output 33 [2025-01-09 15:56:40,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:40,086 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 52 treesize of output 33 [2025-01-09 15:56:40,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:40,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 19 [2025-01-09 15:56:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 15:56:40,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:40,129 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:56:40,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286518735] [2025-01-09 15:56:40,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286518735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:40,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:40,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:56:40,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347532641] [2025-01-09 15:56:40,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:40,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:56:40,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:56:40,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:56:40,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:56:40,130 INFO L87 Difference]: Start difference. First operand 152 states and 215 transitions. Second operand has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:56:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:41,801 INFO L93 Difference]: Finished difference Result 303 states and 429 transitions. [2025-01-09 15:56:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:56:41,801 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2025-01-09 15:56:41,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:41,803 INFO L225 Difference]: With dead ends: 303 [2025-01-09 15:56:41,803 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 15:56:41,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:56:41,804 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 320 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:41,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 457 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 15:56:41,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 15:56:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 131. [2025-01-09 15:56:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.348623853211009) internal successors, (147), 109 states have internal predecessors, (147), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:56:41,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 183 transitions. [2025-01-09 15:56:41,823 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 183 transitions. Word has length 149 [2025-01-09 15:56:41,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:41,824 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 183 transitions. [2025-01-09 15:56:41,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.181818181818182) internal successors, (68), 12 states have internal predecessors, (68), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 15:56:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 183 transitions. [2025-01-09 15:56:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:56:41,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:41,825 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:41,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-01-09 15:56:42,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:42,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:42,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:42,026 INFO L85 PathProgramCache]: Analyzing trace with hash -865675832, now seen corresponding path program 1 times [2025-01-09 15:56:42,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:42,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759666633] [2025-01-09 15:56:42,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:42,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:42,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:42,031 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:56:42,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 15:56:42,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:56:42,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:56:42,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:42,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:42,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 15:56:42,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:42,354 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 15:56:42,359 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 15:56:42,361 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 15:56:42,363 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 15:56:42,365 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 15:56:42,368 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 15:56:42,371 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 15:56:42,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 15:56:42,434 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 30 treesize of output 14 [2025-01-09 15:56:42,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:42,491 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 32 treesize of output 34 [2025-01-09 15:56:42,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:42,728 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 67 treesize of output 63 [2025-01-09 15:56:42,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:42,819 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 67 treesize of output 63 [2025-01-09 15:56:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-01-09 15:56:42,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:42,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:56:42,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759666633] [2025-01-09 15:56:42,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759666633] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:42,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:42,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:56:42,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177090065] [2025-01-09 15:56:42,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:42,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:56:42,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:56:42,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:56:42,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:56:42,920 INFO L87 Difference]: Start difference. First operand 131 states and 183 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:46,080 INFO L93 Difference]: Finished difference Result 431 states and 607 transitions. [2025-01-09 15:56:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:56:46,081 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2025-01-09 15:56:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:46,082 INFO L225 Difference]: With dead ends: 431 [2025-01-09 15:56:46,083 INFO L226 Difference]: Without dead ends: 303 [2025-01-09 15:56:46,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:56:46,084 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 474 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:46,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 412 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 15:56:46,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-09 15:56:46,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 193. [2025-01-09 15:56:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 168 states have (on average 1.369047619047619) internal successors, (230), 169 states have internal predecessors, (230), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:56:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 270 transitions. [2025-01-09 15:56:46,101 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 270 transitions. Word has length 149 [2025-01-09 15:56:46,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:46,102 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 270 transitions. [2025-01-09 15:56:46,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 270 transitions. [2025-01-09 15:56:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:56:46,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:46,104 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:46,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 15:56:46,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:46,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:46,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:46,305 INFO L85 PathProgramCache]: Analyzing trace with hash 453786189, now seen corresponding path program 1 times [2025-01-09 15:56:46,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:46,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023347922] [2025-01-09 15:56:46,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:46,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:46,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:46,307 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:56:46,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-01-09 15:56:46,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:56:46,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:56:46,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:46,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:46,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 15:56:46,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:46,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 15:56:46,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-01-09 15:56:46,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:46,902 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 40 treesize of output 27 [2025-01-09 15:56:46,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:46,998 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 40 treesize of output 27 [2025-01-09 15:56:47,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:47,111 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 40 treesize of output 27 [2025-01-09 15:56:47,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:47,192 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 40 treesize of output 27 [2025-01-09 15:56:47,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:47,249 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 40 treesize of output 27 [2025-01-09 15:56:47,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:47,312 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 40 treesize of output 27 [2025-01-09 15:56:47,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:47,381 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 35 treesize of output 37 [2025-01-09 15:56:47,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:47,577 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 52 treesize of output 51 [2025-01-09 15:56:47,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:47,757 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 83 treesize of output 85 [2025-01-09 15:56:47,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:47,968 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 93 treesize of output 89 [2025-01-09 15:56:48,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:48,224 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 93 treesize of output 89 [2025-01-09 15:56:48,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:48,550 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 146 treesize of output 56 [2025-01-09 15:56:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 15:56:48,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:48,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:56:48,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023347922] [2025-01-09 15:56:48,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023347922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:48,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:48,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:56:48,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878065023] [2025-01-09 15:56:48,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:48,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:56:48,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:56:48,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:56:48,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:56:48,615 INFO L87 Difference]: Start difference. First operand 193 states and 270 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 15:56:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:54,060 INFO L93 Difference]: Finished difference Result 562 states and 790 transitions. [2025-01-09 15:56:54,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:56:54,060 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 151 [2025-01-09 15:56:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:54,063 INFO L225 Difference]: With dead ends: 562 [2025-01-09 15:56:54,063 INFO L226 Difference]: Without dead ends: 372 [2025-01-09 15:56:54,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:56:54,065 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 756 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:54,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 648 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-09 15:56:54,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-01-09 15:56:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 218. [2025-01-09 15:56:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 193 states have (on average 1.383419689119171) internal successors, (267), 194 states have internal predecessors, (267), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 15:56:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 307 transitions. [2025-01-09 15:56:54,086 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 307 transitions. Word has length 151 [2025-01-09 15:56:54,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:54,086 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 307 transitions. [2025-01-09 15:56:54,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 15:56:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 307 transitions. [2025-01-09 15:56:54,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:56:54,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:54,088 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:54,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-01-09 15:56:54,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:54,289 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:54,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash -133019825, now seen corresponding path program 1 times [2025-01-09 15:56:54,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:54,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813953764] [2025-01-09 15:56:54,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:54,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:54,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:54,291 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:56:54,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-01-09 15:56:54,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:56:54,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:56:54,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:54,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:54,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 15:56:54,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:54,758 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 15:56:54,957 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 80 treesize of output 34 [2025-01-09 15:56:55,042 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 80 treesize of output 34 [2025-01-09 15:56:55,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 80 treesize of output 34 [2025-01-09 15:56:55,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:55,255 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 15:56:55,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:55,388 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 93 treesize of output 57 [2025-01-09 15:56:55,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:55,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 105 treesize of output 39 [2025-01-09 15:56:55,493 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-01-09 15:56:55,494 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:56:55,494 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:56:55,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813953764] [2025-01-09 15:56:55,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813953764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:56:55,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:56:55,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:56:55,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319302542] [2025-01-09 15:56:55,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:56:55,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:56:55,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:56:55,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:56:55,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:56:55,495 INFO L87 Difference]: Start difference. First operand 218 states and 307 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:56:58,687 INFO L93 Difference]: Finished difference Result 733 states and 1034 transitions. [2025-01-09 15:56:58,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:56:58,688 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2025-01-09 15:56:58,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:56:58,690 INFO L225 Difference]: With dead ends: 733 [2025-01-09 15:56:58,690 INFO L226 Difference]: Without dead ends: 518 [2025-01-09 15:56:58,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:56:58,691 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 458 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:56:58,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 438 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 15:56:58,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-01-09 15:56:58,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2025-01-09 15:56:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 450 states have (on average 1.3733333333333333) internal successors, (618), 454 states have internal predecessors, (618), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:56:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 722 transitions. [2025-01-09 15:56:58,752 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 722 transitions. Word has length 151 [2025-01-09 15:56:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:56:58,752 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 722 transitions. [2025-01-09 15:56:58,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:56:58,753 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 722 transitions. [2025-01-09 15:56:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:56:58,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:56:58,754 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:56:58,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-01-09 15:56:58,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:58,955 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:56:58,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:56:58,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1938458159, now seen corresponding path program 1 times [2025-01-09 15:56:58,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:56:58,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040554934] [2025-01-09 15:56:58,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:56:58,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:56:58,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:56:58,959 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:56:58,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-01-09 15:56:59,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:56:59,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:56:59,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:56:59,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:56:59,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 15:56:59,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:56:59,336 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 15:56:59,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 15:56:59,388 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 30 treesize of output 14 [2025-01-09 15:56:59,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:59,501 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 39 treesize of output 26 [2025-01-09 15:56:59,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:59,593 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 39 treesize of output 26 [2025-01-09 15:56:59,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:59,676 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 39 treesize of output 26 [2025-01-09 15:56:59,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:59,738 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 39 treesize of output 26 [2025-01-09 15:56:59,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:59,799 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 34 treesize of output 36 [2025-01-09 15:56:59,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:56:59,938 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 44 treesize of output 49 [2025-01-09 15:57:00,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:00,110 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 61 treesize of output 63 [2025-01-09 15:57:00,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:00,426 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 94 treesize of output 85 [2025-01-09 15:57:00,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:00,552 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 98 treesize of output 85 [2025-01-09 15:57:00,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:00,686 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 98 treesize of output 85 [2025-01-09 15:57:00,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:00,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 42 [2025-01-09 15:57:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 475 proven. 30 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-01-09 15:57:00,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:57:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:57:01,052 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:57:01,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040554934] [2025-01-09 15:57:01,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040554934] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:57:01,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:57:01,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2025-01-09 15:57:01,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343616087] [2025-01-09 15:57:01,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:01,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:57:01,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:57:01,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:57:01,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:57:01,054 INFO L87 Difference]: Start difference. First operand 512 states and 722 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:57:02,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:02,146 INFO L93 Difference]: Finished difference Result 1232 states and 1734 transitions. [2025-01-09 15:57:02,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:57:02,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2025-01-09 15:57:02,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:02,153 INFO L225 Difference]: With dead ends: 1232 [2025-01-09 15:57:02,154 INFO L226 Difference]: Without dead ends: 723 [2025-01-09 15:57:02,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:57:02,155 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 74 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:02,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 594 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 15:57:02,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-01-09 15:57:02,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 592. [2025-01-09 15:57:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 527 states have (on average 1.3757115749525617) internal successors, (725), 532 states have internal predecessors, (725), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:57:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 833 transitions. [2025-01-09 15:57:02,216 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 833 transitions. Word has length 151 [2025-01-09 15:57:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:02,216 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 833 transitions. [2025-01-09 15:57:02,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:57:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 833 transitions. [2025-01-09 15:57:02,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:57:02,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:02,218 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:02,229 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 (11)] Forceful destruction successful, exit code 0 [2025-01-09 15:57:02,418 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 15:57:02,419 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:02,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:02,419 INFO L85 PathProgramCache]: Analyzing trace with hash 571575889, now seen corresponding path program 1 times [2025-01-09 15:57:02,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:57:02,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672196242] [2025-01-09 15:57:02,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:02,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:57:02,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:57:02,421 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 15:57:02,422 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 15:57:02,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:57:02,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:57:02,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:02,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:02,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 15:57:02,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:57:02,761 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 15:57:02,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 15:57:02,811 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 30 treesize of output 14 [2025-01-09 15:57:02,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:02,924 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 39 treesize of output 26 [2025-01-09 15:57:03,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:03,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 39 treesize of output 26 [2025-01-09 15:57:03,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:03,100 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 39 treesize of output 26 [2025-01-09 15:57:03,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:03,155 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 39 treesize of output 26 [2025-01-09 15:57:03,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:03,210 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 34 treesize of output 36 [2025-01-09 15:57:03,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:03,322 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 49 treesize of output 39 [2025-01-09 15:57:03,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:03,430 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 51 treesize of output 59 [2025-01-09 15:57:03,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:03,645 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 90 treesize of output 81 [2025-01-09 15:57:03,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:03,760 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 94 treesize of output 81 [2025-01-09 15:57:03,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:03,926 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 94 treesize of output 81 [2025-01-09 15:57:04,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:04,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 123 treesize of output 45 [2025-01-09 15:57:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 459 proven. 30 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-01-09 15:57:04,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:57:04,441 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:57:04,441 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:57:04,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672196242] [2025-01-09 15:57:04,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672196242] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:57:04,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:57:04,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2025-01-09 15:57:04,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797624174] [2025-01-09 15:57:04,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:57:04,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:57:04,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:57:04,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:57:04,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:57:04,443 INFO L87 Difference]: Start difference. First operand 592 states and 833 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:57:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:57:05,919 INFO L93 Difference]: Finished difference Result 1405 states and 1982 transitions. [2025-01-09 15:57:05,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:57:05,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2025-01-09 15:57:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:57:05,942 INFO L225 Difference]: With dead ends: 1405 [2025-01-09 15:57:05,942 INFO L226 Difference]: Without dead ends: 816 [2025-01-09 15:57:05,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 283 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:57:05,944 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 270 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:57:05,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 524 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 15:57:05,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-01-09 15:57:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 590. [2025-01-09 15:57:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 527 states have (on average 1.3776091081593929) internal successors, (726), 531 states have internal predecessors, (726), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:57:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 830 transitions. [2025-01-09 15:57:05,997 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 830 transitions. Word has length 151 [2025-01-09 15:57:05,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:57:05,998 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 830 transitions. [2025-01-09 15:57:05,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:57:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 830 transitions. [2025-01-09 15:57:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:57:06,000 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:57:06,000 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:57:06,011 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 15:57:06,200 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 15:57:06,200 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:57:06,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:57:06,201 INFO L85 PathProgramCache]: Analyzing trace with hash -15230125, now seen corresponding path program 1 times [2025-01-09 15:57:06,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:57:06,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135389591] [2025-01-09 15:57:06,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:57:06,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:57:06,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:57:06,203 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:57:06,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-01-09 15:57:06,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:57:06,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:57:06,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:57:06,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:57:06,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-01-09 15:57:06,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:57:06,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:57:06,871 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 15:57:06,904 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 29 treesize of output 13 [2025-01-09 15:57:07,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:07,107 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 47 treesize of output 28 [2025-01-09 15:57:07,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:07,335 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 56 treesize of output 40 [2025-01-09 15:57:07,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:07,413 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 56 treesize of output 40 [2025-01-09 15:57:07,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:07,528 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 56 treesize of output 40 [2025-01-09 15:57:07,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:07,638 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 51 treesize of output 50 [2025-01-09 15:57:07,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:07,882 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 68 treesize of output 64 [2025-01-09 15:57:08,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:57:08,105 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 101 treesize of output 91