./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.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-97.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 e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:05:23,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:05:23,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:05:23,669 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:05:23,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:05:23,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:05:23,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:05:23,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:05:23,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:05:23,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:05:23,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:05:23,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:05:23,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:05:23,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:05:23,694 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:05:23,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:05:23,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:05:23,695 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:05:23,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:05:23,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:05:23,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:05:23,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:05:23,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:05:23,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:05:23,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:05:23,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:05:23,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:05:23,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:05:23,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:05:23,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:05:23,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:05:23,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:05:23,696 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 -> e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d [2025-01-09 16:05:23,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:05:23,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:05:23,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:05:23,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:05:23,930 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:05:23,931 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-97.i [2025-01-09 16:05:25,036 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/319acc7a1/d00240fc2ace4b70b3bfdcb32e4294bf/FLAGece2b75e8 [2025-01-09 16:05:25,286 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:05:25,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i [2025-01-09 16:05:25,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/319acc7a1/d00240fc2ace4b70b3bfdcb32e4294bf/FLAGece2b75e8 [2025-01-09 16:05:25,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/319acc7a1/d00240fc2ace4b70b3bfdcb32e4294bf [2025-01-09 16:05:25,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:05:25,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:05:25,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:05:25,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:05:25,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:05:25,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:05:25" (1/1) ... [2025-01-09 16:05:25,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25, skipping insertion in model container [2025-01-09 16:05:25,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:05:25" (1/1) ... [2025-01-09 16:05:25,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:05:25,418 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-97.i[916,929] [2025-01-09 16:05:25,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:05:25,471 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:05:25,478 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-97.i[916,929] [2025-01-09 16:05:25,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:05:25,513 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:05:25,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25 WrapperNode [2025-01-09 16:05:25,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:05:25,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:05:25,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:05:25,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:05:25,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25" (1/1) ... [2025-01-09 16:05:25,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25" (1/1) ... [2025-01-09 16:05:25,559 INFO L138 Inliner]: procedures = 30, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 429 [2025-01-09 16:05:25,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:05:25,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:05:25,560 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:05:25,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:05:25,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25" (1/1) ... [2025-01-09 16:05:25,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25" (1/1) ... [2025-01-09 16:05:25,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25" (1/1) ... [2025-01-09 16:05:25,583 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:05:25,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25" (1/1) ... [2025-01-09 16:05:25,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25" (1/1) ... [2025-01-09 16:05:25,593 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25" (1/1) ... [2025-01-09 16:05:25,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25" (1/1) ... [2025-01-09 16:05:25,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25" (1/1) ... [2025-01-09 16:05:25,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25" (1/1) ... [2025-01-09 16:05:25,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25" (1/1) ... [2025-01-09 16:05:25,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:05:25,603 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:05:25,603 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:05:25,603 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:05:25,604 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25" (1/1) ... [2025-01-09 16:05:25,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:05:25,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:05:25,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:05:25,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:05:25,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:05:25,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:05:25,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:05:25,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:05:25,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:05:25,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:05:25,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:05:25,650 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:05:25,650 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:05:25,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:05:25,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:05:25,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:05:25,721 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:05:25,723 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:05:26,144 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-01-09 16:05:26,144 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:05:26,151 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:05:26,151 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:05:26,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:05:26 BoogieIcfgContainer [2025-01-09 16:05:26,151 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:05:26,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:05:26,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:05:26,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:05:26,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:05:25" (1/3) ... [2025-01-09 16:05:26,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8000a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:05:26, skipping insertion in model container [2025-01-09 16:05:26,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:25" (2/3) ... [2025-01-09 16:05:26,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8000a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:05:26, skipping insertion in model container [2025-01-09 16:05:26,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:05:26" (3/3) ... [2025-01-09 16:05:26,158 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-97.i [2025-01-09 16:05:26,167 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:05:26,168 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-97.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:05:26,201 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:05:26,211 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;@48542e55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:05:26,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:05:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 88 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 16:05:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 16:05:26,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:26,225 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:26,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:26,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:26,229 INFO L85 PathProgramCache]: Analyzing trace with hash 989941791, now seen corresponding path program 1 times [2025-01-09 16:05:26,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:26,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776154732] [2025-01-09 16:05:26,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:26,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:26,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:05:26,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:05:26,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:26,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:26,898 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 16:05:26,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:26,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776154732] [2025-01-09 16:05:26,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776154732] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:05:26,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821167350] [2025-01-09 16:05:26,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:26,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:26,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:05:26,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:05:26,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:05:27,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:05:27,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:05:27,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:27,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:27,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:05:27,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:27,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:05:27,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821167350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:27,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:05:27,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 16:05:27,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677351586] [2025-01-09 16:05:27,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:27,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:05:27,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:27,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:05:27,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:05:27,168 INFO L87 Difference]: Start difference. First operand has 107 states, 87 states have (on average 1.3908045977011494) internal successors, (121), 88 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:27,221 INFO L93 Difference]: Finished difference Result 211 states and 326 transitions. [2025-01-09 16:05:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:05:27,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-01-09 16:05:27,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:27,231 INFO L225 Difference]: With dead ends: 211 [2025-01-09 16:05:27,232 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 16:05:27,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:05:27,238 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:27,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 430 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:05:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 16:05:27,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-01-09 16:05:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 16:05:27,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2025-01-09 16:05:27,270 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 134 [2025-01-09 16:05:27,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:27,271 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2025-01-09 16:05:27,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:27,272 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2025-01-09 16:05:27,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 16:05:27,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:27,275 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:27,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:05:27,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 16:05:27,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:27,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:27,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1670000161, now seen corresponding path program 1 times [2025-01-09 16:05:27,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:27,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568999888] [2025-01-09 16:05:27,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:27,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:27,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:05:27,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:05:27,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:27,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 16:05:27,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:27,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568999888] [2025-01-09 16:05:27,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568999888] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:05:27,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386656090] [2025-01-09 16:05:27,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:27,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:27,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:05:27,749 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:05:27,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:05:27,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:05:27,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:05:27,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:27,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:27,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:05:27,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:27,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:05:27,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386656090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:27,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:05:27,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 16:05:27,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917198820] [2025-01-09 16:05:27,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:27,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:05:27,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:27,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:05:27,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:05:27,958 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:27,996 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2025-01-09 16:05:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:05:27,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-01-09 16:05:27,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:27,998 INFO L225 Difference]: With dead ends: 212 [2025-01-09 16:05:27,998 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 16:05:27,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:05:27,999 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:27,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 431 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:05:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 16:05:28,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-01-09 16:05:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 16:05:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2025-01-09 16:05:28,006 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 134 [2025-01-09 16:05:28,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:28,006 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2025-01-09 16:05:28,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2025-01-09 16:05:28,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 16:05:28,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:28,008 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:28,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:05:28,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:28,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:28,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:28,209 INFO L85 PathProgramCache]: Analyzing trace with hash -849959773, now seen corresponding path program 1 times [2025-01-09 16:05:28,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:28,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035124827] [2025-01-09 16:05:28,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:28,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:28,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:05:28,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:05:28,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:28,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 16:05:28,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:28,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035124827] [2025-01-09 16:05:28,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035124827] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:05:28,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016107889] [2025-01-09 16:05:28,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:28,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:28,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:05:28,424 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 16:05:28,427 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 16:05:28,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:05:28,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:05:28,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:28,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:28,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:05:28,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:28,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:05:28,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016107889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:28,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:05:28,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 16:05:28,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515305131] [2025-01-09 16:05:28,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:28,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:05:28,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:28,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:05:28,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:05:28,609 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:28,639 INFO L93 Difference]: Finished difference Result 216 states and 309 transitions. [2025-01-09 16:05:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:05:28,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-01-09 16:05:28,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:28,640 INFO L225 Difference]: With dead ends: 216 [2025-01-09 16:05:28,640 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 16:05:28,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:05:28,641 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:28,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:05:28,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 16:05:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-01-09 16:05:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 16:05:28,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2025-01-09 16:05:28,647 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 134 [2025-01-09 16:05:28,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:28,648 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2025-01-09 16:05:28,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2025-01-09 16:05:28,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 16:05:28,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:28,649 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:28,656 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 16:05:28,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:28,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:28,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:28,850 INFO L85 PathProgramCache]: Analyzing trace with hash -848112731, now seen corresponding path program 1 times [2025-01-09 16:05:28,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:28,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600845729] [2025-01-09 16:05:28,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:28,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:28,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:05:28,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:05:28,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:28,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 16:05:29,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:29,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600845729] [2025-01-09 16:05:29,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600845729] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:05:29,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011195864] [2025-01-09 16:05:29,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:29,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:29,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:05:29,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:05:29,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:05:29,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:05:29,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:05:29,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:29,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:29,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:05:29,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:29,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:05:29,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011195864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:29,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:05:29,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 16:05:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681619342] [2025-01-09 16:05:29,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:29,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:05:29,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:29,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:05:29,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:05:29,205 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:29,240 INFO L93 Difference]: Finished difference Result 219 states and 312 transitions. [2025-01-09 16:05:29,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:05:29,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-01-09 16:05:29,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:29,243 INFO L225 Difference]: With dead ends: 219 [2025-01-09 16:05:29,243 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 16:05:29,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:05:29,245 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:29,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:05:29,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 16:05:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-09 16:05:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 16:05:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2025-01-09 16:05:29,251 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 134 [2025-01-09 16:05:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:29,251 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2025-01-09 16:05:29,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2025-01-09 16:05:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 16:05:29,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:29,253 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:29,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 16:05:29,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:29,454 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:29,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:29,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1843520809, now seen corresponding path program 1 times [2025-01-09 16:05:29,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:29,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171927563] [2025-01-09 16:05:29,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:29,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:29,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:05:29,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:05:29,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:29,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:29,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:29,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171927563] [2025-01-09 16:05:29,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171927563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:29,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:29,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:05:29,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644515244] [2025-01-09 16:05:29,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:29,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:05:29,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:29,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:05:29,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:05:29,935 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:30,422 INFO L93 Difference]: Finished difference Result 312 states and 439 transitions. [2025-01-09 16:05:30,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:05:30,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-01-09 16:05:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:30,424 INFO L225 Difference]: With dead ends: 312 [2025-01-09 16:05:30,424 INFO L226 Difference]: Without dead ends: 203 [2025-01-09 16:05:30,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:05:30,425 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 283 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:30,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 389 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:05:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-01-09 16:05:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 114. [2025-01-09 16:05:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 16:05:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2025-01-09 16:05:30,439 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 136 [2025-01-09 16:05:30,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:30,440 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2025-01-09 16:05:30,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2025-01-09 16:05:30,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 16:05:30,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:30,441 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:30,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:05:30,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:30,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:30,442 INFO L85 PathProgramCache]: Analyzing trace with hash -917257568, now seen corresponding path program 1 times [2025-01-09 16:05:30,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:30,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111340188] [2025-01-09 16:05:30,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:30,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:30,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:05:30,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:05:30,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:30,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 16:05:31,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:31,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111340188] [2025-01-09 16:05:31,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111340188] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:05:31,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053655166] [2025-01-09 16:05:31,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:31,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:31,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:05:31,282 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:05:31,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:05:31,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:05:31,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:05:31,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:31,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:31,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 16:05:31,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:31,644 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 17 [2025-01-09 16:05:31,678 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 17 [2025-01-09 16:05:31,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:05:31,716 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 55 treesize of output 35 [2025-01-09 16:05:31,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:05:31,781 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 42 treesize of output 47 [2025-01-09 16:05:31,819 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 149 treesize of output 113 [2025-01-09 16:05:31,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:05:31,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 113 treesize of output 165 [2025-01-09 16:05:31,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 100 [2025-01-09 16:05:32,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:05:32,089 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 181 treesize of output 67 [2025-01-09 16:05:32,107 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 232 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-01-09 16:05:32,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:05:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 16:05:32,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053655166] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:05:32,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:05:32,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 20 [2025-01-09 16:05:32,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939381886] [2025-01-09 16:05:32,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:05:32,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 16:05:32,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:32,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 16:05:32,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:05:32,393 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 20 states, 17 states have (on average 4.823529411764706) internal successors, (82), 20 states have internal predecessors, (82), 5 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 2 states have call predecessors, (23), 5 states have call successors, (23) [2025-01-09 16:05:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:34,070 INFO L93 Difference]: Finished difference Result 446 states and 616 transitions. [2025-01-09 16:05:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 16:05:34,070 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 4.823529411764706) internal successors, (82), 20 states have internal predecessors, (82), 5 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 2 states have call predecessors, (23), 5 states have call successors, (23) Word has length 136 [2025-01-09 16:05:34,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:34,072 INFO L225 Difference]: With dead ends: 446 [2025-01-09 16:05:34,072 INFO L226 Difference]: Without dead ends: 335 [2025-01-09 16:05:34,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 261 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=344, Invalid=1462, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 16:05:34,073 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 622 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:34,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1133 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 16:05:34,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-01-09 16:05:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 317. [2025-01-09 16:05:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 257 states have (on average 1.2918287937743191) internal successors, (332), 260 states have internal predecessors, (332), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 16:05:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 436 transitions. [2025-01-09 16:05:34,098 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 436 transitions. Word has length 136 [2025-01-09 16:05:34,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:34,098 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 436 transitions. [2025-01-09 16:05:34,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 4.823529411764706) internal successors, (82), 20 states have internal predecessors, (82), 5 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 2 states have call predecessors, (23), 5 states have call successors, (23) [2025-01-09 16:05:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 436 transitions. [2025-01-09 16:05:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 16:05:34,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:34,100 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:34,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:05:34,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:34,304 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:34,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:34,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1051271074, now seen corresponding path program 1 times [2025-01-09 16:05:34,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:34,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032340] [2025-01-09 16:05:34,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:34,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:34,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:05:34,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:05:34,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:34,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:35,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:35,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032340] [2025-01-09 16:05:35,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:35,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:35,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:05:35,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422579478] [2025-01-09 16:05:35,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:35,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:05:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:35,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:05:35,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:05:35,770 INFO L87 Difference]: Start difference. First operand 317 states and 436 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:36,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:36,110 INFO L93 Difference]: Finished difference Result 683 states and 935 transitions. [2025-01-09 16:05:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:05:36,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-01-09 16:05:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:36,113 INFO L225 Difference]: With dead ends: 683 [2025-01-09 16:05:36,113 INFO L226 Difference]: Without dead ends: 394 [2025-01-09 16:05:36,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:05:36,114 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 74 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:36,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 764 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:05:36,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-09 16:05:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 390. [2025-01-09 16:05:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 323 states have (on average 1.2941176470588236) internal successors, (418), 327 states have internal predecessors, (418), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 16:05:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 534 transitions. [2025-01-09 16:05:36,137 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 534 transitions. Word has length 136 [2025-01-09 16:05:36,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:36,137 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 534 transitions. [2025-01-09 16:05:36,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:36,137 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 534 transitions. [2025-01-09 16:05:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 16:05:36,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:36,139 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:36,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:05:36,139 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:36,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:36,139 INFO L85 PathProgramCache]: Analyzing trace with hash 583429549, now seen corresponding path program 1 times [2025-01-09 16:05:36,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:36,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344282673] [2025-01-09 16:05:36,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:36,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:36,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 16:05:36,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 16:05:36,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:36,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:36,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:36,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344282673] [2025-01-09 16:05:36,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344282673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:36,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:36,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:05:36,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655900303] [2025-01-09 16:05:36,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:36,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:05:36,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:36,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:05:36,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:05:36,310 INFO L87 Difference]: Start difference. First operand 390 states and 534 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:36,610 INFO L93 Difference]: Finished difference Result 1126 states and 1538 transitions. [2025-01-09 16:05:36,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:05:36,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2025-01-09 16:05:36,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:36,614 INFO L225 Difference]: With dead ends: 1126 [2025-01-09 16:05:36,614 INFO L226 Difference]: Without dead ends: 764 [2025-01-09 16:05:36,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:05:36,615 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 131 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:36,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 973 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:05:36,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-01-09 16:05:36,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 402. [2025-01-09 16:05:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 335 states have (on average 1.2955223880597015) internal successors, (434), 339 states have internal predecessors, (434), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 16:05:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 550 transitions. [2025-01-09 16:05:36,654 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 550 transitions. Word has length 137 [2025-01-09 16:05:36,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:36,654 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 550 transitions. [2025-01-09 16:05:36,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:36,655 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 550 transitions. [2025-01-09 16:05:36,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 16:05:36,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:36,656 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:36,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:05:36,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:36,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:36,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1410050418, now seen corresponding path program 1 times [2025-01-09 16:05:36,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:36,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180365567] [2025-01-09 16:05:36,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:36,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:36,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 16:05:36,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 16:05:36,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:36,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:37,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:37,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180365567] [2025-01-09 16:05:37,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180365567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:37,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:37,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:05:37,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612594191] [2025-01-09 16:05:37,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:37,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:05:37,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:37,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:05:37,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:05:37,274 INFO L87 Difference]: Start difference. First operand 402 states and 550 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:37,675 INFO L93 Difference]: Finished difference Result 957 states and 1298 transitions. [2025-01-09 16:05:37,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:05:37,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2025-01-09 16:05:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:37,679 INFO L225 Difference]: With dead ends: 957 [2025-01-09 16:05:37,680 INFO L226 Difference]: Without dead ends: 583 [2025-01-09 16:05:37,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:05:37,681 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 107 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:37,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 664 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:05:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-01-09 16:05:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 273. [2025-01-09 16:05:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 226 states have (on average 1.2876106194690264) internal successors, (291), 228 states have internal predecessors, (291), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 16:05:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 371 transitions. [2025-01-09 16:05:37,713 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 371 transitions. Word has length 138 [2025-01-09 16:05:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:37,714 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 371 transitions. [2025-01-09 16:05:37,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 371 transitions. [2025-01-09 16:05:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 16:05:37,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:37,715 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:37,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:05:37,716 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:37,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1174563822, now seen corresponding path program 1 times [2025-01-09 16:05:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:37,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656020173] [2025-01-09 16:05:37,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:37,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:37,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 16:05:37,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 16:05:37,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:37,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:38,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:38,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656020173] [2025-01-09 16:05:38,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656020173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:38,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:38,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:05:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753963841] [2025-01-09 16:05:38,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:38,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:05:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:38,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:05:38,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:05:38,270 INFO L87 Difference]: Start difference. First operand 273 states and 371 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:38,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:38,556 INFO L93 Difference]: Finished difference Result 643 states and 868 transitions. [2025-01-09 16:05:38,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:05:38,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-01-09 16:05:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:38,559 INFO L225 Difference]: With dead ends: 643 [2025-01-09 16:05:38,559 INFO L226 Difference]: Without dead ends: 421 [2025-01-09 16:05:38,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:05:38,560 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 105 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:38,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 481 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:05:38,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-01-09 16:05:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 273. [2025-01-09 16:05:38,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 226 states have (on average 1.2787610619469028) internal successors, (289), 228 states have internal predecessors, (289), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 16:05:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 369 transitions. [2025-01-09 16:05:38,579 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 369 transitions. Word has length 139 [2025-01-09 16:05:38,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:38,579 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 369 transitions. [2025-01-09 16:05:38,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 369 transitions. [2025-01-09 16:05:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 16:05:38,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:38,581 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:38,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:05:38,581 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:38,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1914757776, now seen corresponding path program 1 times [2025-01-09 16:05:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:38,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378349468] [2025-01-09 16:05:38,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:38,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 16:05:38,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 16:05:38,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:38,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:38,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:38,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378349468] [2025-01-09 16:05:38,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378349468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:38,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:38,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:05:38,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574296740] [2025-01-09 16:05:38,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:38,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:05:38,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:38,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:05:38,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:05:38,911 INFO L87 Difference]: Start difference. First operand 273 states and 369 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 16:05:39,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:39,079 INFO L93 Difference]: Finished difference Result 495 states and 669 transitions. [2025-01-09 16:05:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:05:39,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-01-09 16:05:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:39,081 INFO L225 Difference]: With dead ends: 495 [2025-01-09 16:05:39,081 INFO L226 Difference]: Without dead ends: 273 [2025-01-09 16:05:39,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:05:39,082 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 185 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:39,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 171 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:05:39,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-01-09 16:05:39,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2025-01-09 16:05:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 226 states have (on average 1.2699115044247788) internal successors, (287), 228 states have internal predecessors, (287), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 16:05:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 367 transitions. [2025-01-09 16:05:39,106 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 367 transitions. Word has length 139 [2025-01-09 16:05:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:39,106 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 367 transitions. [2025-01-09 16:05:39,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 16:05:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 367 transitions. [2025-01-09 16:05:39,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 16:05:39,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:39,107 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:39,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:05:39,107 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:39,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:39,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1353398093, now seen corresponding path program 1 times [2025-01-09 16:05:39,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:39,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113266392] [2025-01-09 16:05:39,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:39,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:39,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:05:39,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:05:39,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:39,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:39,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:39,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113266392] [2025-01-09 16:05:39,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113266392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:39,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:39,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:05:39,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062007744] [2025-01-09 16:05:39,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:39,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:05:39,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:39,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:05:39,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:05:39,422 INFO L87 Difference]: Start difference. First operand 273 states and 367 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:39,893 INFO L93 Difference]: Finished difference Result 649 states and 869 transitions. [2025-01-09 16:05:39,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:05:39,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-01-09 16:05:39,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:39,896 INFO L225 Difference]: With dead ends: 649 [2025-01-09 16:05:39,896 INFO L226 Difference]: Without dead ends: 427 [2025-01-09 16:05:39,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:05:39,897 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 236 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:39,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 335 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:05:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-01-09 16:05:39,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 273. [2025-01-09 16:05:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 226 states have (on average 1.252212389380531) internal successors, (283), 228 states have internal predecessors, (283), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 16:05:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 363 transitions. [2025-01-09 16:05:39,929 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 363 transitions. Word has length 140 [2025-01-09 16:05:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:39,930 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 363 transitions. [2025-01-09 16:05:39,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:39,930 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 363 transitions. [2025-01-09 16:05:39,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 16:05:39,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:39,932 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:39,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:05:39,932 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:39,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:39,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1776099919, now seen corresponding path program 1 times [2025-01-09 16:05:39,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:39,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718559213] [2025-01-09 16:05:39,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:39,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:39,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:05:40,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:05:40,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:40,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:41,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:41,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718559213] [2025-01-09 16:05:41,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718559213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:41,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:41,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:05:41,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698234070] [2025-01-09 16:05:41,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:41,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:05:41,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:41,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:05:41,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:05:41,594 INFO L87 Difference]: Start difference. First operand 273 states and 363 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:41,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:41,929 INFO L93 Difference]: Finished difference Result 588 states and 777 transitions. [2025-01-09 16:05:41,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:05:41,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-01-09 16:05:41,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:41,931 INFO L225 Difference]: With dead ends: 588 [2025-01-09 16:05:41,931 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 16:05:41,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:05:41,932 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 55 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:41,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 864 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:05:41,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 16:05:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 275. [2025-01-09 16:05:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 228 states have (on average 1.25) internal successors, (285), 230 states have internal predecessors, (285), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 16:05:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 365 transitions. [2025-01-09 16:05:41,953 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 365 transitions. Word has length 140 [2025-01-09 16:05:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:41,954 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 365 transitions. [2025-01-09 16:05:41,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 365 transitions. [2025-01-09 16:05:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 16:05:41,955 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:41,955 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:41,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:05:41,955 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:41,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:41,956 INFO L85 PathProgramCache]: Analyzing trace with hash 930519475, now seen corresponding path program 1 times [2025-01-09 16:05:41,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:41,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328537287] [2025-01-09 16:05:41,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:41,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:41,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:05:42,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:05:42,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:42,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:42,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:42,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328537287] [2025-01-09 16:05:42,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328537287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:42,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:42,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:05:42,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556969848] [2025-01-09 16:05:42,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:42,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:05:42,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:42,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:05:42,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:05:42,284 INFO L87 Difference]: Start difference. First operand 275 states and 365 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:42,715 INFO L93 Difference]: Finished difference Result 645 states and 855 transitions. [2025-01-09 16:05:42,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:05:42,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-01-09 16:05:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:42,717 INFO L225 Difference]: With dead ends: 645 [2025-01-09 16:05:42,718 INFO L226 Difference]: Without dead ends: 421 [2025-01-09 16:05:42,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:05:42,718 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 230 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:42,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 408 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:05:42,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-01-09 16:05:42,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 255. [2025-01-09 16:05:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 208 states have (on average 1.2259615384615385) internal successors, (255), 210 states have internal predecessors, (255), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 16:05:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 335 transitions. [2025-01-09 16:05:42,739 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 335 transitions. Word has length 140 [2025-01-09 16:05:42,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:42,740 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 335 transitions. [2025-01-09 16:05:42,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 335 transitions. [2025-01-09 16:05:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 16:05:42,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:42,742 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:42,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:05:42,742 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:42,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash 909019878, now seen corresponding path program 1 times [2025-01-09 16:05:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979397301] [2025-01-09 16:05:42,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:42,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:05:42,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:05:42,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:42,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:42,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:42,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979397301] [2025-01-09 16:05:42,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979397301] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:42,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:42,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:05:42,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650376671] [2025-01-09 16:05:42,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:42,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:05:42,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:42,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:05:42,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:05:42,991 INFO L87 Difference]: Start difference. First operand 255 states and 335 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:43,216 INFO L93 Difference]: Finished difference Result 267 states and 347 transitions. [2025-01-09 16:05:43,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:05:43,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-01-09 16:05:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:43,218 INFO L225 Difference]: With dead ends: 267 [2025-01-09 16:05:43,218 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 16:05:43,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:05:43,220 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 77 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:43,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 550 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:05:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 16:05:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-01-09 16:05:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 217 states have (on average 1.2165898617511521) internal successors, (264), 219 states have internal predecessors, (264), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 16:05:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 344 transitions. [2025-01-09 16:05:43,239 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 344 transitions. Word has length 140 [2025-01-09 16:05:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:43,239 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 344 transitions. [2025-01-09 16:05:43,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:43,239 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 344 transitions. [2025-01-09 16:05:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 16:05:43,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:43,241 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:43,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:05:43,241 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:43,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:43,242 INFO L85 PathProgramCache]: Analyzing trace with hash 910866920, now seen corresponding path program 1 times [2025-01-09 16:05:43,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:43,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633626459] [2025-01-09 16:05:43,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:43,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:43,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:05:43,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:05:43,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:43,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:43,757 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 16:05:43,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:43,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633626459] [2025-01-09 16:05:43,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633626459] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:05:43,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825448360] [2025-01-09 16:05:43,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:43,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:43,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:05:43,759 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:05:43,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:05:43,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:05:43,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:05:43,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:43,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:43,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 16:05:43,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:43,989 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 13 treesize of output 9 [2025-01-09 16:05:44,004 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 121 treesize of output 91 [2025-01-09 16:05:44,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:05:44,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 113 [2025-01-09 16:05:44,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 67 [2025-01-09 16:05:44,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:05:44,216 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 125 treesize of output 47 [2025-01-09 16:05:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:44,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:05:44,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825448360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:44,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:05:44,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2025-01-09 16:05:44,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84853311] [2025-01-09 16:05:44,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:44,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:05:44,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:44,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:05:44,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:05:44,270 INFO L87 Difference]: Start difference. First operand 265 states and 344 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:44,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:44,976 INFO L93 Difference]: Finished difference Result 692 states and 890 transitions. [2025-01-09 16:05:44,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 16:05:44,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-01-09 16:05:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:44,978 INFO L225 Difference]: With dead ends: 692 [2025-01-09 16:05:44,978 INFO L226 Difference]: Without dead ends: 478 [2025-01-09 16:05:44,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2025-01-09 16:05:44,979 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 205 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:44,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1274 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:05:44,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-01-09 16:05:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 342. [2025-01-09 16:05:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 294 states have (on average 1.2414965986394557) internal successors, (365), 296 states have internal predecessors, (365), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 16:05:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 445 transitions. [2025-01-09 16:05:44,996 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 445 transitions. Word has length 140 [2025-01-09 16:05:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:44,997 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 445 transitions. [2025-01-09 16:05:44,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 445 transitions. [2025-01-09 16:05:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 16:05:44,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:44,998 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:45,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 16:05:45,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 16:05:45,199 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:45,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:45,199 INFO L85 PathProgramCache]: Analyzing trace with hash -929034644, now seen corresponding path program 1 times [2025-01-09 16:05:45,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:45,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819054458] [2025-01-09 16:05:45,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:45,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:45,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:05:45,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:05:45,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:45,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:45,622 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 16:05:45,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:45,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819054458] [2025-01-09 16:05:45,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819054458] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:05:45,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979024722] [2025-01-09 16:05:45,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:45,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:45,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:05:45,625 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:05:45,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:05:45,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:05:45,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:05:45,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:45,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:45,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 16:05:45,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:45,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:05:45,939 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 17 [2025-01-09 16:05:45,962 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 17 [2025-01-09 16:05:45,988 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 17 [2025-01-09 16:05:46,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:05:46,016 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 55 treesize of output 53 [2025-01-09 16:05:46,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:05:46,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 73 treesize of output 31 [2025-01-09 16:05:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-01-09 16:05:46,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:05:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 16:05:46,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979024722] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:05:46,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:05:46,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2025-01-09 16:05:46,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106653331] [2025-01-09 16:05:46,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:05:46,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:05:46,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:46,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:05:46,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:05:46,228 INFO L87 Difference]: Start difference. First operand 342 states and 445 transitions. Second operand has 13 states, 10 states have (on average 8.5) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) [2025-01-09 16:05:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:46,959 INFO L93 Difference]: Finished difference Result 567 states and 729 transitions. [2025-01-09 16:05:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:05:46,960 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 8.5) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) Word has length 140 [2025-01-09 16:05:46,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:46,963 INFO L225 Difference]: With dead ends: 567 [2025-01-09 16:05:46,963 INFO L226 Difference]: Without dead ends: 276 [2025-01-09 16:05:46,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 275 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2025-01-09 16:05:46,968 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 432 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:46,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 397 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:05:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-01-09 16:05:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 272. [2025-01-09 16:05:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 222 states have (on average 1.2072072072072073) internal successors, (268), 224 states have internal predecessors, (268), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 16:05:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 348 transitions. [2025-01-09 16:05:46,991 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 348 transitions. Word has length 140 [2025-01-09 16:05:46,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:46,991 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 348 transitions. [2025-01-09 16:05:46,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 8.5) internal successors, (85), 13 states have internal predecessors, (85), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) [2025-01-09 16:05:46,992 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 348 transitions. [2025-01-09 16:05:46,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 16:05:46,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:46,993 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:47,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 16:05:47,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:47,194 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:47,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:47,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1135250643, now seen corresponding path program 1 times [2025-01-09 16:05:47,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:47,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941814163] [2025-01-09 16:05:47,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:47,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:47,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:05:47,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:05:47,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:47,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:47,392 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:47,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:47,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941814163] [2025-01-09 16:05:47,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941814163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:47,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:47,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:05:47,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341492830] [2025-01-09 16:05:47,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:47,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:05:47,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:47,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:05:47,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:05:47,394 INFO L87 Difference]: Start difference. First operand 272 states and 348 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:47,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:47,585 INFO L93 Difference]: Finished difference Result 692 states and 882 transitions. [2025-01-09 16:05:47,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:05:47,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-01-09 16:05:47,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:47,587 INFO L225 Difference]: With dead ends: 692 [2025-01-09 16:05:47,588 INFO L226 Difference]: Without dead ends: 475 [2025-01-09 16:05:47,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:05:47,588 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 125 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:47,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 547 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:05:47,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-01-09 16:05:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 273. [2025-01-09 16:05:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 223 states have (on average 1.2062780269058295) internal successors, (269), 225 states have internal predecessors, (269), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 16:05:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 349 transitions. [2025-01-09 16:05:47,609 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 349 transitions. Word has length 140 [2025-01-09 16:05:47,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:47,609 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 349 transitions. [2025-01-09 16:05:47,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 349 transitions. [2025-01-09 16:05:47,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 16:05:47,610 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:47,610 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:47,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 16:05:47,610 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:47,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash 625777553, now seen corresponding path program 1 times [2025-01-09 16:05:47,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:47,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338855560] [2025-01-09 16:05:47,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:47,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:47,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:05:47,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:05:47,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:47,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 16:05:48,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:48,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338855560] [2025-01-09 16:05:48,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338855560] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:05:48,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953961091] [2025-01-09 16:05:48,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:48,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:48,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:05:48,101 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:05:48,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 16:05:48,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:05:48,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:05:48,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:48,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:48,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 16:05:48,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:48,352 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 39 treesize of output 26 [2025-01-09 16:05:48,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 43 [2025-01-09 16:05:48,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2025-01-09 16:05:48,381 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 131 treesize of output 99 [2025-01-09 16:05:48,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:05:48,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 117 [2025-01-09 16:05:48,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 64 [2025-01-09 16:05:48,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:05:48,705 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 125 treesize of output 47 [2025-01-09 16:05:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:05:48,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:05:48,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953961091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:48,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:05:48,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2025-01-09 16:05:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753007474] [2025-01-09 16:05:48,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:48,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:05:48,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:48,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:05:48,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:05:48,766 INFO L87 Difference]: Start difference. First operand 273 states and 349 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:49,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:49,641 INFO L93 Difference]: Finished difference Result 560 states and 712 transitions. [2025-01-09 16:05:49,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:05:49,642 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-01-09 16:05:49,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:49,644 INFO L225 Difference]: With dead ends: 560 [2025-01-09 16:05:49,644 INFO L226 Difference]: Without dead ends: 342 [2025-01-09 16:05:49,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2025-01-09 16:05:49,645 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 308 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:49,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 740 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 16:05:49,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-01-09 16:05:49,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 294. [2025-01-09 16:05:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 244 states have (on average 1.221311475409836) internal successors, (298), 246 states have internal predecessors, (298), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 16:05:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 378 transitions. [2025-01-09 16:05:49,668 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 378 transitions. Word has length 140 [2025-01-09 16:05:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:49,668 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 378 transitions. [2025-01-09 16:05:49,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:05:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 378 transitions. [2025-01-09 16:05:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 16:05:49,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:49,669 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:49,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 16:05:49,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:49,870 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:49,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:49,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1214124011, now seen corresponding path program 1 times [2025-01-09 16:05:49,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:49,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968633364] [2025-01-09 16:05:49,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:49,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:49,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:05:49,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:05:49,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:49,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 16:05:50,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:05:50,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968633364] [2025-01-09 16:05:50,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968633364] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:05:50,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007340836] [2025-01-09 16:05:50,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:50,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:50,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:05:50,517 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:05:50,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 16:05:50,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:05:50,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:05:50,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:50,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:50,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 16:05:50,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:50,808 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 17 [2025-01-09 16:05:50,830 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 17 [2025-01-09 16:05:50,853 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 17 [2025-01-09 16:05:50,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:05:50,875 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 55 treesize of output 35 [2025-01-09 16:05:50,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:05:50,923 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 42 treesize of output 47 [2025-01-09 16:05:50,953 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 149 treesize of output 113 [2025-01-09 16:05:50,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:05:50,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 113 treesize of output 165 [2025-01-09 16:05:51,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 63 [2025-01-09 16:05:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 276 proven. 18 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-01-09 16:05:51,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:05:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-01-09 16:05:51,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007340836] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:05:51,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:05:51,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 30 [2025-01-09 16:05:51,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499915137] [2025-01-09 16:05:51,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:05:51,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 16:05:51,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:05:51,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 16:05:51,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-01-09 16:05:51,582 INFO L87 Difference]: Start difference. First operand 294 states and 378 transitions. Second operand has 30 states, 26 states have (on average 4.269230769230769) internal successors, (111), 30 states have internal predecessors, (111), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 3 states have call predecessors, (36), 7 states have call successors, (36) [2025-01-09 16:05:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:54,255 INFO L93 Difference]: Finished difference Result 733 states and 928 transitions. [2025-01-09 16:05:54,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-09 16:05:54,256 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 4.269230769230769) internal successors, (111), 30 states have internal predecessors, (111), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 3 states have call predecessors, (36), 7 states have call successors, (36) Word has length 140 [2025-01-09 16:05:54,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:05:54,258 INFO L225 Difference]: With dead ends: 733 [2025-01-09 16:05:54,258 INFO L226 Difference]: Without dead ends: 494 [2025-01-09 16:05:54,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 264 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=878, Invalid=4234, Unknown=0, NotChecked=0, Total=5112 [2025-01-09 16:05:54,259 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 837 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 2618 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 2962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 2618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 16:05:54,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1624 Invalid, 2962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 2618 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 16:05:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-01-09 16:05:54,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 337. [2025-01-09 16:05:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 286 states have (on average 1.2167832167832169) internal successors, (348), 288 states have internal predecessors, (348), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 16:05:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 428 transitions. [2025-01-09 16:05:54,282 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 428 transitions. Word has length 140 [2025-01-09 16:05:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:05:54,282 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 428 transitions. [2025-01-09 16:05:54,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 4.269230769230769) internal successors, (111), 30 states have internal predecessors, (111), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (36), 3 states have call predecessors, (36), 7 states have call successors, (36) [2025-01-09 16:05:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 428 transitions. [2025-01-09 16:05:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 16:05:54,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:54,284 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:54,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 16:05:54,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:05:54,485 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:54,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:54,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1184014130, now seen corresponding path program 1 times [2025-01-09 16:05:54,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:05:54,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970640299] [2025-01-09 16:05:54,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:54,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:05:54,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 16:05:54,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 16:05:54,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:54,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:05:54,576 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:05:54,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 16:05:54,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 16:05:54,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:54,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:05:54,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:05:54,649 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:05:54,649 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:05:54,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 16:05:54,652 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:54,682 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:05:54,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:05:54 BoogieIcfgContainer [2025-01-09 16:05:54,684 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:05:54,684 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:05:54,684 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:05:54,684 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:05:54,685 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:05:26" (3/4) ... [2025-01-09 16:05:54,686 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:05:54,687 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:05:54,687 INFO L158 Benchmark]: Toolchain (without parser) took 29379.79ms. Allocated memory was 201.3MB in the beginning and 167.8MB in the end (delta: -33.6MB). Free memory was 158.2MB in the beginning and 48.6MB in the end (delta: 109.6MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2025-01-09 16:05:54,687 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 218.1MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:05:54,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.82ms. Allocated memory is still 201.3MB. Free memory was 158.2MB in the beginning and 142.3MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:05:54,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.95ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 138.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:05:54,688 INFO L158 Benchmark]: Boogie Preprocessor took 42.40ms. Allocated memory is still 201.3MB. Free memory was 138.8MB in the beginning and 135.9MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:05:54,688 INFO L158 Benchmark]: RCFGBuilder took 548.58ms. Allocated memory is still 201.3MB. Free memory was 135.9MB in the beginning and 106.4MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 16:05:54,688 INFO L158 Benchmark]: TraceAbstraction took 28530.77ms. Allocated memory was 201.3MB in the beginning and 167.8MB in the end (delta: -33.6MB). Free memory was 105.7MB in the beginning and 48.7MB in the end (delta: 57.1MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2025-01-09 16:05:54,688 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 167.8MB. Free memory was 48.7MB in the beginning and 48.6MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:05:54,689 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.17ms. Allocated memory is still 218.1MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.82ms. Allocated memory is still 201.3MB. Free memory was 158.2MB in the beginning and 142.3MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.95ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 138.8MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.40ms. Allocated memory is still 201.3MB. Free memory was 138.8MB in the beginning and 135.9MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 548.58ms. Allocated memory is still 201.3MB. Free memory was 135.9MB in the beginning and 106.4MB in the end (delta: 29.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 28530.77ms. Allocated memory was 201.3MB in the beginning and 167.8MB in the end (delta: -33.6MB). Free memory was 105.7MB in the beginning and 48.7MB in the end (delta: 57.1MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 167.8MB. Free memory was 48.7MB in the beginning and 48.6MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 120, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryFLOATComparisonOperation at line 120. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 16, 32, 20113, 100, 100, -1, 16, 1, 0, 1, 10, 256, 32.5, 127.4, 128 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L124] isInitial = 1 [L125] FCALL initially() [L127] FCALL updateLastVariables() [L128] CALL updateVariables() [L90] WrapperStruct00.var_1_7 = __VERIFIER_nondet_short() [L91] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -1) 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_7 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32766) 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_7 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L94] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 16383) 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_8 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 32766) 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_8 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 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_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) 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_9 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) 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_11 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) 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_11 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -31) 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_12 >= -31) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 32) 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_12 <= 32) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) 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_15 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) 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_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 1) 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_16 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ushort() [L112] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 65534) 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_19 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] WrapperStruct00.var_1_21 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_21 [L115] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_21 [L115] EXPR WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 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] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_21 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_21 <= -1.0e-20F) || (WrapperStruct00.var_1_21 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_21 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L128] RET updateVariables() [L129] CALL step() [L60] EXPR WrapperStruct00.var_1_19 [L60] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L61] EXPR WrapperStruct00.var_1_21 [L61] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L62] EXPR WrapperStruct00.var_1_12 [L62] WrapperStruct00.var_1_22 = WrapperStruct00.var_1_12 [L63] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L63] COND TRUE 127.5f > WrapperStruct00.var_1_20 [L64] EXPR WrapperStruct00.var_1_15 [L64] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 [L64] EXPR WrapperStruct00.var_1_16 [L64] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L64] WrapperStruct00.var_1_13 = (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16) [L68] EXPR WrapperStruct00.var_1_18 [L68] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] COND TRUE WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7 [L69] EXPR WrapperStruct00.var_1_11 [L69] EXPR WrapperStruct00.var_1_12 [L69] WrapperStruct00.var_1_10 = (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)) [L77] WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L77] COND TRUE WrapperStruct00.var_1_13 [L78] EXPR WrapperStruct00.var_1_10 [L78] EXPR WrapperStruct00.var_1_22 VAL [WrapperStruct00={4:0}, isInitial=1] [L78] COND FALSE !(WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) [L85] WrapperStruct00.var_1_1 = 8 VAL [WrapperStruct00={4:0}, isInitial=1] [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1 [L120] EXPR WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_22 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8)) [L120] EXPR WrapperStruct00.var_1_1 [L120] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1)) [L120] EXPR WrapperStruct00.var_1_18 [L120] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1) [L120] EXPR WrapperStruct00.var_1_10 [L120] EXPR WrapperStruct00.var_1_11 [L120] EXPR WrapperStruct00.var_1_12 [L120] EXPR (WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15)))) [L120] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))) [L120] EXPR WrapperStruct00.var_1_13 [L120] EXPR WrapperStruct00.var_1_20 [L120] EXPR WrapperStruct00.var_1_20 [L120] EXPR (WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19)) [L120] EXPR WrapperStruct00.var_1_18 [L120] EXPR WrapperStruct00.var_1_19 [L120] EXPR (((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR ((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21)) [L120] EXPR WrapperStruct00.var_1_20 [L120] EXPR WrapperStruct00.var_1_21 [L120] EXPR ((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR (((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((signed short int) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1] [L120-L121] return (((((WrapperStruct00.var_1_13 ? ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_22) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_1 == ((signed short int) (WrapperStruct00.var_1_7 - (WrapperStruct00.var_1_8 - WrapperStruct00.var_1_9)))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18))) : (WrapperStruct00.var_1_1 == ((signed short int) 8))) : 1) && ((WrapperStruct00.var_1_18 == WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_10 == ((signed char) (WrapperStruct00.var_1_11 + (WrapperStruct00.var_1_12 + -25)))) : ((((32 * -25) | WrapperStruct00.var_1_22) >= WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_13 ? (WrapperStruct00.var_1_10 == ((signed char) WrapperStruct00.var_1_12)) : 1) : 1))) && ((127.5f > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((unsigned char) ((WrapperStruct00.var_1_20 >= WrapperStruct00.var_1_20) || WrapperStruct00.var_1_15))))) && (WrapperStruct00.var_1_18 == ((unsigned short int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_21))) && (WrapperStruct00.var_1_22 == ((signed short int) WrapperStruct00.var_1_12)) ; [L130] RET, EXPR property() [L130] 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, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.5s, OverallIterations: 21, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4048 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4015 mSDsluCounter, 13041 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10193 mSDsCounter, 992 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9663 IncrementalHoareTripleChecker+Invalid, 10655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 992 mSolverCounterUnsat, 2848 mSDtfsCounter, 9663 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1997 GetRequests, 1702 SyntacticMatches, 20 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1849 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=402occurred in iteration=8, InterpolantAutomatonStates: 212, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 1892 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 4132 NumberOfCodeBlocks, 4132 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 4373 ConstructedInterpolants, 0 QuantifiedInterpolants, 14561 SizeOfPredicates, 22 NumberOfNonLiveVariables, 4552 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 32 InterpolantComputations, 17 PerfectInterpolantSequences, 17204/17408 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 16:05:54,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.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 e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:05:56,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:05:56,630 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 16:05:56,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:05:56,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:05:56,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:05:56,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:05:56,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:05:56,664 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:05:56,664 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:05:56,664 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:05:56,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:05:56,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:05:56,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:05:56,665 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:05:56,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:05:56,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:05:56,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:05:56,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:05:56,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:05:56,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:05:56,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:05:56,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:05:56,666 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:05:56,667 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:05:56,667 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:05:56,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:05:56,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:05:56,667 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:05:56,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:05:56,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:05:56,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:05:56,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:05:56,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:05:56,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:05:56,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:05:56,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:05:56,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:05:56,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:05:56,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:05:56,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:05:56,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:05:56,669 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:05:56,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:05:56,669 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:05:56,669 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:05:56,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:05:56,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:05:56,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:05:56,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:05:56,669 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 -> e67445e12651560afd9610d5a103069fc2fc9d028994dc4bd874cfab54748c3d [2025-01-09 16:05:56,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:05:56,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:05:56,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:05:56,921 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:05:56,921 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:05:56,922 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-97.i [2025-01-09 16:05:58,117 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e96846200/124b34b679b641fcb890a95927a0f856/FLAG89b54d5e8 [2025-01-09 16:05:58,313 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:05:58,313 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-97.i [2025-01-09 16:05:58,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e96846200/124b34b679b641fcb890a95927a0f856/FLAG89b54d5e8 [2025-01-09 16:05:58,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e96846200/124b34b679b641fcb890a95927a0f856 [2025-01-09 16:05:58,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:05:58,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:05:58,673 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:05:58,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:05:58,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:05:58,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:05:58" (1/1) ... [2025-01-09 16:05:58,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453b8d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58, skipping insertion in model container [2025-01-09 16:05:58,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:05:58" (1/1) ... [2025-01-09 16:05:58,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:05:58,785 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-97.i[916,929] [2025-01-09 16:05:58,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:05:58,835 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:05:58,843 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-97.i[916,929] [2025-01-09 16:05:58,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:05:58,880 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:05:58,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58 WrapperNode [2025-01-09 16:05:58,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:05:58,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:05:58,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:05:58,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:05:58,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58" (1/1) ... [2025-01-09 16:05:58,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58" (1/1) ... [2025-01-09 16:05:58,934 INFO L138 Inliner]: procedures = 34, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 405 [2025-01-09 16:05:58,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:05:58,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:05:58,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:05:58,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:05:58,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58" (1/1) ... [2025-01-09 16:05:58,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58" (1/1) ... [2025-01-09 16:05:58,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58" (1/1) ... [2025-01-09 16:05:58,973 INFO L175 MemorySlicer]: Split 117 memory accesses to 2 slices as follows [2, 115]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2025-01-09 16:05:58,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58" (1/1) ... [2025-01-09 16:05:58,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58" (1/1) ... [2025-01-09 16:05:59,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58" (1/1) ... [2025-01-09 16:05:59,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58" (1/1) ... [2025-01-09 16:05:59,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58" (1/1) ... [2025-01-09 16:05:59,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58" (1/1) ... [2025-01-09 16:05:59,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58" (1/1) ... [2025-01-09 16:05:59,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:05:59,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:05:59,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:05:59,017 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:05:59,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58" (1/1) ... [2025-01-09 16:05:59,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:05:59,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:05:59,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:05:59,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:05:59,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:05:59,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:05:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:05:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:05:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:05:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 16:05:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 16:05:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 16:05:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 16:05:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 16:05:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 16:05:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 16:05:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 16:05:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 16:05:59,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 16:05:59,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:05:59,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:05:59,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-01-09 16:05:59,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-01-09 16:05:59,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:05:59,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:05:59,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:05:59,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:05:59,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 16:05:59,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 16:05:59,136 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:05:59,137 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:05:59,544 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2025-01-09 16:05:59,544 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:05:59,557 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:05:59,557 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:05:59,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:05:59 BoogieIcfgContainer [2025-01-09 16:05:59,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:05:59,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:05:59,579 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:05:59,583 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:05:59,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:05:58" (1/3) ... [2025-01-09 16:05:59,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6fd345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:05:59, skipping insertion in model container [2025-01-09 16:05:59,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:05:58" (2/3) ... [2025-01-09 16:05:59,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6fd345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:05:59, skipping insertion in model container [2025-01-09 16:05:59,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:05:59" (3/3) ... [2025-01-09 16:05:59,586 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-97.i [2025-01-09 16:05:59,596 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:05:59,597 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-97.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:05:59,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:05:59,646 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;@4eec9e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:05:59,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:05:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 79 states have (on average 1.379746835443038) internal successors, (109), 80 states have internal predecessors, (109), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 16:05:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 16:05:59,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:05:59,659 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:05:59,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:05:59,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:05:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash 760160382, now seen corresponding path program 1 times [2025-01-09 16:05:59,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:05:59,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331293924] [2025-01-09 16:05:59,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:05:59,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:05:59,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:05:59,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:05:59,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 16:05:59,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:05:59,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:05:59,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:05:59,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:05:59,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:05:59,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:05:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-01-09 16:05:59,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:05:59,945 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:05:59,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331293924] [2025-01-09 16:05:59,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331293924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:05:59,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:05:59,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:05:59,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823285541] [2025-01-09 16:05:59,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:05:59,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:05:59,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:05:59,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:05:59,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:05:59,968 INFO L87 Difference]: Start difference. First operand has 99 states, 79 states have (on average 1.379746835443038) internal successors, (109), 80 states have internal predecessors, (109), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 16:05:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:05:59,993 INFO L93 Difference]: Finished difference Result 192 states and 298 transitions. [2025-01-09 16:05:59,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:05:59,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2025-01-09 16:05:59,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:00,002 INFO L225 Difference]: With dead ends: 192 [2025-01-09 16:06:00,003 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 16:06:00,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:06:00,006 INFO L435 NwaCegarLoop]: 138 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, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:00,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:06:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 16:06:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-01-09 16:06:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 16:06:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-01-09 16:06:00,032 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 134 [2025-01-09 16:06:00,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:00,032 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-01-09 16:06:00,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 16:06:00,032 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-01-09 16:06:00,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 16:06:00,035 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:00,035 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:00,042 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 (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:06:00,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:00,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:00,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:00,238 INFO L85 PathProgramCache]: Analyzing trace with hash 906177372, now seen corresponding path program 1 times [2025-01-09 16:06:00,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:00,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856381874] [2025-01-09 16:06:00,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:00,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:00,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:00,241 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:00,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 16:06:00,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 16:06:00,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 16:06:00,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:00,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:00,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:06:00,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:06:00,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:06:00,507 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:00,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856381874] [2025-01-09 16:06:00,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856381874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:00,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:00,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:06:00,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559990916] [2025-01-09 16:06:00,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:00,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:06:00,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:00,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:06:00,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:06:00,508 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:00,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:00,545 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2025-01-09 16:06:00,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:06:00,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2025-01-09 16:06:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:00,548 INFO L225 Difference]: With dead ends: 191 [2025-01-09 16:06:00,548 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 16:06:00,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:06:00,549 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:00,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:06:00,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 16:06:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 16:06:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 16:06:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-01-09 16:06:00,562 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 134 [2025-01-09 16:06:00,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:00,563 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-01-09 16:06:00,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-01-09 16:06:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 16:06:00,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:00,567 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:00,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 16:06:00,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:00,768 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:00,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:00,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1242314606, now seen corresponding path program 1 times [2025-01-09 16:06:00,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:00,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846632488] [2025-01-09 16:06:00,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:00,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:00,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:00,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:00,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 16:06:00,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:06:00,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:06:00,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:00,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:00,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:06:00,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:06:01,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:06:01,005 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:01,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846632488] [2025-01-09 16:06:01,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846632488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:01,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:01,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:06:01,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69682298] [2025-01-09 16:06:01,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:01,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:06:01,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:01,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:06:01,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:06:01,007 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:01,512 INFO L93 Difference]: Finished difference Result 274 states and 391 transitions. [2025-01-09 16:06:01,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:06:01,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-01-09 16:06:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:01,514 INFO L225 Difference]: With dead ends: 274 [2025-01-09 16:06:01,514 INFO L226 Difference]: Without dead ends: 179 [2025-01-09 16:06:01,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:06:01,515 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 101 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:01,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 500 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:06:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-01-09 16:06:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 100. [2025-01-09 16:06:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 16:06:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2025-01-09 16:06:01,522 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 136 [2025-01-09 16:06:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:01,523 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2025-01-09 16:06:01,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2025-01-09 16:06:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 16:06:01,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:01,524 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:01,531 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 16:06:01,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:01,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:01,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:01,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2126389449, now seen corresponding path program 1 times [2025-01-09 16:06:01,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:01,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138046977] [2025-01-09 16:06:01,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:01,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:01,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:01,729 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:01,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 16:06:01,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:06:01,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:06:01,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:01,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:01,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:06:01,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:06:01,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:06:01,894 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:01,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138046977] [2025-01-09 16:06:01,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138046977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:01,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:01,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:06:01,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243965361] [2025-01-09 16:06:01,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:01,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:06:01,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:01,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:06:01,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:06:01,895 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:01,914 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2025-01-09 16:06:01,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:06:01,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-01-09 16:06:01,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:01,917 INFO L225 Difference]: With dead ends: 200 [2025-01-09 16:06:01,917 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 16:06:01,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:06:01,918 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:01,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 394 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:06:01,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 16:06:01,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-01-09 16:06:01,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 16:06:01,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2025-01-09 16:06:01,925 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 136 [2025-01-09 16:06:01,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:01,928 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2025-01-09 16:06:01,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2025-01-09 16:06:01,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 16:06:01,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:01,929 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:01,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 16:06:02,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:02,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:02,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:02,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1446331079, now seen corresponding path program 1 times [2025-01-09 16:06:02,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:02,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524254665] [2025-01-09 16:06:02,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:02,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:02,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:02,135 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:02,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 16:06:02,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:06:02,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:06:02,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:02,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:02,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:06:02,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:06:02,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:06:02,308 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524254665] [2025-01-09 16:06:02,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524254665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:02,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:02,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:06:02,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973598857] [2025-01-09 16:06:02,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:02,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:06:02,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:02,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:06:02,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:06:02,309 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:02,349 INFO L93 Difference]: Finished difference Result 204 states and 289 transitions. [2025-01-09 16:06:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:06:02,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-01-09 16:06:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:02,350 INFO L225 Difference]: With dead ends: 204 [2025-01-09 16:06:02,350 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 16:06:02,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 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 16:06:02,351 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:02,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 517 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:06:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 16:06:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-01-09 16:06:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 85 states have internal predecessors, (112), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 16:06:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2025-01-09 16:06:02,357 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 136 [2025-01-09 16:06:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:02,357 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2025-01-09 16:06:02,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2025-01-09 16:06:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 16:06:02,358 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:02,358 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:02,366 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 16:06:02,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:02,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:02,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:02,559 INFO L85 PathProgramCache]: Analyzing trace with hash 328676283, now seen corresponding path program 1 times [2025-01-09 16:06:02,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:02,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210572709] [2025-01-09 16:06:02,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:02,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:02,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:02,563 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:02,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 16:06:02,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:06:02,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:06:02,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:02,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:02,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:06:02,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:06:02,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:06:02,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:02,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210572709] [2025-01-09 16:06:02,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1210572709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:02,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:02,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:06:02,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348990348] [2025-01-09 16:06:02,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:02,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:06:02,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:02,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:06:02,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:06:02,729 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:02,765 INFO L93 Difference]: Finished difference Result 208 states and 293 transitions. [2025-01-09 16:06:02,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:06:02,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-01-09 16:06:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:02,766 INFO L225 Difference]: With dead ends: 208 [2025-01-09 16:06:02,766 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 16:06:02,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:06:02,767 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:02,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 640 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:06:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 16:06:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2025-01-09 16:06:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 87 states have internal predecessors, (114), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 16:06:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2025-01-09 16:06:02,774 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 136 [2025-01-09 16:06:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:02,775 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2025-01-09 16:06:02,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2025-01-09 16:06:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 16:06:02,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:02,776 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:02,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2025-01-09 16:06:02,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:02,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:02,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:02,977 INFO L85 PathProgramCache]: Analyzing trace with hash 330523325, now seen corresponding path program 1 times [2025-01-09 16:06:02,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:02,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067212993] [2025-01-09 16:06:02,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:02,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:02,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:02,980 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:02,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 16:06:03,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:06:03,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:06:03,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:03,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:03,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:06:03,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:03,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 16:06:03,197 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 16:06:03,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-01-09 16:06:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:06:03,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:06:03,215 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:03,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067212993] [2025-01-09 16:06:03,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067212993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:03,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:03,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:06:03,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890369972] [2025-01-09 16:06:03,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:03,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:06:03,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:03,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:06:03,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:06:03,217 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:03,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:03,534 INFO L93 Difference]: Finished difference Result 312 states and 438 transitions. [2025-01-09 16:06:03,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:06:03,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-01-09 16:06:03,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:03,536 INFO L225 Difference]: With dead ends: 312 [2025-01-09 16:06:03,536 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 16:06:03,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:06:03,536 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 118 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:03,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 437 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:06:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 16:06:03,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 113. [2025-01-09 16:06:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 94 states have internal predecessors, (124), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 16:06:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 158 transitions. [2025-01-09 16:06:03,542 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 158 transitions. Word has length 136 [2025-01-09 16:06:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:03,542 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 158 transitions. [2025-01-09 16:06:03,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2025-01-09 16:06:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 16:06:03,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:03,543 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:03,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 16:06:03,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:03,747 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:03,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:03,747 INFO L85 PathProgramCache]: Analyzing trace with hash 196509819, now seen corresponding path program 1 times [2025-01-09 16:06:03,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:03,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737222191] [2025-01-09 16:06:03,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:03,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:03,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:03,750 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:03,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-01-09 16:06:03,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:06:03,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:06:03,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:03,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:03,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 16:06:03,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:03,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 16:06:04,134 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 16:06:04,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:04,302 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 16:06:04,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:04,408 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 16:06:04,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:04,489 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 76 treesize of output 53 [2025-01-09 16:06:04,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:04,622 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 64 treesize of output 66 [2025-01-09 16:06:04,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:04,710 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 79 treesize of output 69 [2025-01-09 16:06:04,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:04,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 70 treesize of output 28 [2025-01-09 16:06:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 30 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2025-01-09 16:06:04,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:06:05,063 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-01-09 16:06:05,063 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:05,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737222191] [2025-01-09 16:06:05,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737222191] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:06:05,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:06:05,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2025-01-09 16:06:05,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428036537] [2025-01-09 16:06:05,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:06:05,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 16:06:05,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:05,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 16:06:05,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:06:05,065 INFO L87 Difference]: Start difference. First operand 113 states and 158 transitions. Second operand has 22 states, 18 states have (on average 4.722222222222222) internal successors, (85), 21 states have internal predecessors, (85), 7 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) [2025-01-09 16:06:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:07,669 INFO L93 Difference]: Finished difference Result 375 states and 511 transitions. [2025-01-09 16:06:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 16:06:07,670 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 4.722222222222222) internal successors, (85), 21 states have internal predecessors, (85), 7 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) Word has length 136 [2025-01-09 16:06:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:07,671 INFO L225 Difference]: With dead ends: 375 [2025-01-09 16:06:07,671 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 16:06:07,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=430, Invalid=1732, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 16:06:07,673 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 378 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:07,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 779 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 16:06:07,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 16:06:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 218. [2025-01-09 16:06:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 173 states have (on average 1.2716763005780347) internal successors, (220), 175 states have internal predecessors, (220), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 16:06:07,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 296 transitions. [2025-01-09 16:06:07,688 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 296 transitions. Word has length 136 [2025-01-09 16:06:07,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:07,688 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 296 transitions. [2025-01-09 16:06:07,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 4.722222222222222) internal successors, (85), 21 states have internal predecessors, (85), 7 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) [2025-01-09 16:06:07,688 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 296 transitions. [2025-01-09 16:06:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 16:06:07,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:07,689 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:07,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-01-09 16:06:07,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:07,893 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:07,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:07,893 INFO L85 PathProgramCache]: Analyzing trace with hash -164346732, now seen corresponding path program 1 times [2025-01-09 16:06:07,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:07,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171794122] [2025-01-09 16:06:07,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:07,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:07,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:07,895 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:07,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-01-09 16:06:07,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:06:08,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:06:08,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:08,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:08,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 16:06:08,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:08,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 16:06:08,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2025-01-09 16:06:08,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 20 [2025-01-09 16:06:08,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:08,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 61 [2025-01-09 16:06:08,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:08,451 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 72 treesize of output 77 [2025-01-09 16:06:08,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:08,536 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 87 treesize of output 80 [2025-01-09 16:06:08,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:08,553 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 78 treesize of output 30 [2025-01-09 16:06:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 238 proven. 18 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-09 16:06:08,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:06:08,832 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-01-09 16:06:08,833 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:08,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171794122] [2025-01-09 16:06:08,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171794122] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:06:08,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:06:08,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2025-01-09 16:06:08,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291428394] [2025-01-09 16:06:08,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:06:08,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 16:06:08,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:08,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 16:06:08,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:06:08,834 INFO L87 Difference]: Start difference. First operand 218 states and 296 transitions. Second operand has 21 states, 17 states have (on average 4.882352941176471) internal successors, (83), 21 states have internal predecessors, (83), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 7 states have call successors, (22) [2025-01-09 16:06:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:11,985 INFO L93 Difference]: Finished difference Result 565 states and 743 transitions. [2025-01-09 16:06:11,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 16:06:11,985 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 4.882352941176471) internal successors, (83), 21 states have internal predecessors, (83), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 7 states have call successors, (22) Word has length 136 [2025-01-09 16:06:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:11,988 INFO L225 Difference]: With dead ends: 565 [2025-01-09 16:06:11,988 INFO L226 Difference]: Without dead ends: 371 [2025-01-09 16:06:11,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=1664, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 16:06:11,989 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 427 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:11,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1082 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 16:06:11,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-09 16:06:12,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 164. [2025-01-09 16:06:12,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 127 states have (on average 1.236220472440945) internal successors, (157), 128 states have internal predecessors, (157), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 16:06:12,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 213 transitions. [2025-01-09 16:06:12,007 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 213 transitions. Word has length 136 [2025-01-09 16:06:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:12,008 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 213 transitions. [2025-01-09 16:06:12,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 4.882352941176471) internal successors, (83), 21 states have internal predecessors, (83), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 7 states have call successors, (22) [2025-01-09 16:06:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 213 transitions. [2025-01-09 16:06:12,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 16:06:12,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:12,008 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:12,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-01-09 16:06:12,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:12,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:12,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:12,213 INFO L85 PathProgramCache]: Analyzing trace with hash -298360238, now seen corresponding path program 1 times [2025-01-09 16:06:12,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:12,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050822926] [2025-01-09 16:06:12,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:12,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:12,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:12,216 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:12,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-01-09 16:06:12,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 16:06:12,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 16:06:12,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:12,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:12,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 16:06:12,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:12,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 16:06:12,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2025-01-09 16:06:12,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2025-01-09 16:06:13,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2025-01-09 16:06:13,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:13,096 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 79 treesize of output 65 [2025-01-09 16:06:13,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:13,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 95 treesize of output 41 [2025-01-09 16:06:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 294 proven. 30 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:06:13,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:06:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-01-09 16:06:13,379 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:13,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050822926] [2025-01-09 16:06:13,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050822926] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:06:13,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:06:13,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2025-01-09 16:06:13,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285895172] [2025-01-09 16:06:13,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:06:13,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 16:06:13,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:13,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 16:06:13,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:06:13,381 INFO L87 Difference]: Start difference. First operand 164 states and 213 transitions. Second operand has 18 states, 14 states have (on average 5.642857142857143) internal successors, (79), 16 states have internal predecessors, (79), 7 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) [2025-01-09 16:06:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:15,136 INFO L93 Difference]: Finished difference Result 291 states and 375 transitions. [2025-01-09 16:06:15,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 16:06:15,136 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 5.642857142857143) internal successors, (79), 16 states have internal predecessors, (79), 7 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) Word has length 136 [2025-01-09 16:06:15,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:15,137 INFO L225 Difference]: With dead ends: 291 [2025-01-09 16:06:15,137 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 16:06:15,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:06:15,140 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 243 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:15,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 370 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 16:06:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 16:06:15,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2025-01-09 16:06:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 118 states have (on average 1.2118644067796611) internal successors, (143), 119 states have internal predecessors, (143), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 16:06:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 199 transitions. [2025-01-09 16:06:15,160 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 199 transitions. Word has length 136 [2025-01-09 16:06:15,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:15,160 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 199 transitions. [2025-01-09 16:06:15,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 5.642857142857143) internal successors, (79), 16 states have internal predecessors, (79), 7 states have call successors, (24), 4 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 7 states have call successors, (24) [2025-01-09 16:06:15,160 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 199 transitions. [2025-01-09 16:06:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 16:06:15,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:15,165 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:15,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-01-09 16:06:15,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:15,366 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:15,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:15,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1667363279, now seen corresponding path program 1 times [2025-01-09 16:06:15,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:15,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567616763] [2025-01-09 16:06:15,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:15,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:15,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:15,369 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:15,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 (12)] Waiting until timeout for monitored process [2025-01-09 16:06:15,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 16:06:15,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 16:06:15,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:15,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:15,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:06:15,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:15,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 16:06:15,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-01-09 16:06:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:06:15,555 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:06:15,555 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:15,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567616763] [2025-01-09 16:06:15,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567616763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:15,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:15,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:06:15,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781938815] [2025-01-09 16:06:15,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:15,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:06:15,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:15,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:06:15,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:06:15,556 INFO L87 Difference]: Start difference. First operand 155 states and 199 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:15,924 INFO L93 Difference]: Finished difference Result 408 states and 521 transitions. [2025-01-09 16:06:15,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:06:15,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2025-01-09 16:06:15,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:15,926 INFO L225 Difference]: With dead ends: 408 [2025-01-09 16:06:15,926 INFO L226 Difference]: Without dead ends: 283 [2025-01-09 16:06:15,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:06:15,927 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 117 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:15,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 717 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:06:15,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-01-09 16:06:15,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 159. [2025-01-09 16:06:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 122 states have (on average 1.221311475409836) internal successors, (149), 123 states have internal predecessors, (149), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 16:06:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 205 transitions. [2025-01-09 16:06:15,939 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 205 transitions. Word has length 137 [2025-01-09 16:06:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:15,940 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 205 transitions. [2025-01-09 16:06:15,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 205 transitions. [2025-01-09 16:06:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 16:06:15,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:15,941 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:15,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-01-09 16:06:16,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:16,141 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:16,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:16,142 INFO L85 PathProgramCache]: Analyzing trace with hash -741100038, now seen corresponding path program 1 times [2025-01-09 16:06:16,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:16,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127970158] [2025-01-09 16:06:16,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:16,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:16,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:16,148 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:16,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-01-09 16:06:16,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 16:06:16,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 16:06:16,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:16,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:16,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:06:16,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:16,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 16:06:16,373 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 16:06:16,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-01-09 16:06:16,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-01-09 16:06:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:06:16,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:06:16,392 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:16,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127970158] [2025-01-09 16:06:16,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127970158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:16,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:16,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:06:16,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55923291] [2025-01-09 16:06:16,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:16,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:06:16,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:16,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:06:16,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:06:16,393 INFO L87 Difference]: Start difference. First operand 159 states and 205 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:16,676 INFO L93 Difference]: Finished difference Result 419 states and 537 transitions. [2025-01-09 16:06:16,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:06:16,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 137 [2025-01-09 16:06:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:16,678 INFO L225 Difference]: With dead ends: 419 [2025-01-09 16:06:16,679 INFO L226 Difference]: Without dead ends: 290 [2025-01-09 16:06:16,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:06:16,680 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 114 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:16,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 421 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:06:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-01-09 16:06:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 172. [2025-01-09 16:06:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.237037037037037) internal successors, (167), 136 states have internal predecessors, (167), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 16:06:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 223 transitions. [2025-01-09 16:06:16,705 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 223 transitions. Word has length 137 [2025-01-09 16:06:16,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:16,705 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 223 transitions. [2025-01-09 16:06:16,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 223 transitions. [2025-01-09 16:06:16,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 16:06:16,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:16,707 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:16,714 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 (13)] Forceful destruction successful, exit code 0 [2025-01-09 16:06:16,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:16,908 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:16,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:16,908 INFO L85 PathProgramCache]: Analyzing trace with hash -600551428, now seen corresponding path program 1 times [2025-01-09 16:06:16,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:16,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788733184] [2025-01-09 16:06:16,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:16,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:16,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:16,910 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:16,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-01-09 16:06:17,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 16:06:17,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 16:06:17,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:17,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:17,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 16:06:17,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:17,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 16:06:17,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2025-01-09 16:06:17,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:17,443 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 57 treesize of output 47 [2025-01-09 16:06:17,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:17,617 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 72 treesize of output 50 [2025-01-09 16:06:17,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:17,720 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 99 treesize of output 82 [2025-01-09 16:06:17,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:17,895 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 75 treesize of output 89 [2025-01-09 16:06:18,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:18,017 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 90 treesize of output 92 [2025-01-09 16:06:18,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:18,109 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 86 treesize of output 92 [2025-01-09 16:06:18,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:18,141 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 81 treesize of output 33 [2025-01-09 16:06:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 318 proven. 30 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2025-01-09 16:06:18,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:06:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 60 proven. 30 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-01-09 16:06:18,414 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:18,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788733184] [2025-01-09 16:06:18,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788733184] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:06:18,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:06:18,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2025-01-09 16:06:18,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978897026] [2025-01-09 16:06:18,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:06:18,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 16:06:18,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:18,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 16:06:18,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:06:18,415 INFO L87 Difference]: Start difference. First operand 172 states and 223 transitions. Second operand has 25 states, 21 states have (on average 4.380952380952381) internal successors, (92), 22 states have internal predecessors, (92), 8 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) [2025-01-09 16:06:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:22,011 INFO L93 Difference]: Finished difference Result 448 states and 576 transitions. [2025-01-09 16:06:22,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-01-09 16:06:22,011 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 4.380952380952381) internal successors, (92), 22 states have internal predecessors, (92), 8 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) Word has length 137 [2025-01-09 16:06:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:22,013 INFO L225 Difference]: With dead ends: 448 [2025-01-09 16:06:22,013 INFO L226 Difference]: Without dead ends: 306 [2025-01-09 16:06:22,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=665, Invalid=2415, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 16:06:22,014 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 417 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:22,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 969 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 16:06:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-01-09 16:06:22,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 171. [2025-01-09 16:06:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 134 states have (on average 1.2388059701492538) internal successors, (166), 135 states have internal predecessors, (166), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 16:06:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 222 transitions. [2025-01-09 16:06:22,029 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 222 transitions. Word has length 137 [2025-01-09 16:06:22,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:22,029 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 222 transitions. [2025-01-09 16:06:22,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 4.380952380952381) internal successors, (92), 22 states have internal predecessors, (92), 8 states have call successors, (24), 5 states have call predecessors, (24), 6 states have return successors, (24), 6 states have call predecessors, (24), 8 states have call successors, (24) [2025-01-09 16:06:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 222 transitions. [2025-01-09 16:06:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 16:06:22,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:22,030 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:22,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-01-09 16:06:22,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:22,234 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:22,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:22,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1097797379, now seen corresponding path program 1 times [2025-01-09 16:06:22,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:22,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337860879] [2025-01-09 16:06:22,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:22,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:22,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:22,239 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:22,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-01-09 16:06:22,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 16:06:22,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 16:06:22,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:22,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:22,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 16:06:22,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:22,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 16:06:22,571 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 16:06:22,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:22,667 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 16:06:22,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:22,727 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 79 treesize of output 65 [2025-01-09 16:06:22,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:22,867 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 82 treesize of output 81 [2025-01-09 16:06:22,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:22,958 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 92 treesize of output 85 [2025-01-09 16:06:23,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:23,012 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 88 treesize of output 85 [2025-01-09 16:06:23,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:23,033 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 83 treesize of output 35 [2025-01-09 16:06:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 238 proven. 18 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-01-09 16:06:23,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:06:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 72 proven. 18 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-01-09 16:06:23,306 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:23,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337860879] [2025-01-09 16:06:23,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337860879] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:06:23,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:06:23,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2025-01-09 16:06:23,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025256647] [2025-01-09 16:06:23,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 16:06:23,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 16:06:23,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:23,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 16:06:23,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:06:23,307 INFO L87 Difference]: Start difference. First operand 171 states and 222 transitions. Second operand has 22 states, 18 states have (on average 4.833333333333333) internal successors, (87), 21 states have internal predecessors, (87), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 7 states have call successors, (22) [2025-01-09 16:06:26,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:26,060 INFO L93 Difference]: Finished difference Result 433 states and 554 transitions. [2025-01-09 16:06:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-01-09 16:06:26,061 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 4.833333333333333) internal successors, (87), 21 states have internal predecessors, (87), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 7 states have call successors, (22) Word has length 137 [2025-01-09 16:06:26,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:26,063 INFO L225 Difference]: With dead ends: 433 [2025-01-09 16:06:26,063 INFO L226 Difference]: Without dead ends: 292 [2025-01-09 16:06:26,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=430, Invalid=1732, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 16:06:26,064 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 443 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:26,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 922 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 16:06:26,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-01-09 16:06:26,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 159. [2025-01-09 16:06:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 122 states have (on average 1.2049180327868851) internal successors, (147), 123 states have internal predecessors, (147), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 16:06:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 203 transitions. [2025-01-09 16:06:26,099 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 203 transitions. Word has length 137 [2025-01-09 16:06:26,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:26,099 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 203 transitions. [2025-01-09 16:06:26,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 4.833333333333333) internal successors, (87), 21 states have internal predecessors, (87), 7 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 7 states have call successors, (22) [2025-01-09 16:06:26,100 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 203 transitions. [2025-01-09 16:06:26,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 16:06:26,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:26,105 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:26,120 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 (15)] Forceful destruction successful, exit code 0 [2025-01-09 16:06:26,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:26,306 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:26,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:26,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1241464841, now seen corresponding path program 1 times [2025-01-09 16:06:26,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:26,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098390359] [2025-01-09 16:06:26,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:26,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:26,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:26,308 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:26,309 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 (16)] Waiting until timeout for monitored process [2025-01-09 16:06:26,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 16:06:26,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 16:06:26,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:26,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:26,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 16:06:26,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:26,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 16:06:26,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2025-01-09 16:06:26,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2025-01-09 16:06:26,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:26,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 37 [2025-01-09 16:06:27,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:27,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 37 [2025-01-09 16:06:27,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:27,163 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 89 treesize of output 69 [2025-01-09 16:06:27,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:27,250 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 70 treesize of output 66 [2025-01-09 16:06:27,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:27,289 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 85 treesize of output 93 [2025-01-09 16:06:27,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:27,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 143 treesize of output 151 [2025-01-09 16:06:27,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:27,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 157 treesize of output 69 [2025-01-09 16:06:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 346 proven. 42 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-01-09 16:06:27,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:06:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:06:28,108 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:28,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098390359] [2025-01-09 16:06:28,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098390359] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:06:28,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:06:28,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 21 [2025-01-09 16:06:28,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430443947] [2025-01-09 16:06:28,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:28,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:06:28,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:28,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:06:28,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:06:28,109 INFO L87 Difference]: Start difference. First operand 159 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:28,469 INFO L93 Difference]: Finished difference Result 395 states and 498 transitions. [2025-01-09 16:06:28,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:06:28,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2025-01-09 16:06:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:28,471 INFO L225 Difference]: With dead ends: 395 [2025-01-09 16:06:28,471 INFO L226 Difference]: Without dead ends: 266 [2025-01-09 16:06:28,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-01-09 16:06:28,471 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 166 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:28,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 475 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:06:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-09 16:06:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 159. [2025-01-09 16:06:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 122 states have (on average 1.1967213114754098) internal successors, (146), 123 states have internal predecessors, (146), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 16:06:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 202 transitions. [2025-01-09 16:06:28,492 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 202 transitions. Word has length 138 [2025-01-09 16:06:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:28,493 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 202 transitions. [2025-01-09 16:06:28,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2025-01-09 16:06:28,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 16:06:28,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:28,494 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:28,502 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 (16)] Ended with exit code 0 [2025-01-09 16:06:28,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:28,695 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:28,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:28,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2097010100, now seen corresponding path program 1 times [2025-01-09 16:06:28,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:28,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630327413] [2025-01-09 16:06:28,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:28,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:28,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:28,699 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:28,702 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 (17)] Waiting until timeout for monitored process [2025-01-09 16:06:28,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 16:06:28,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 16:06:28,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:28,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:28,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 16:06:28,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:28,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:06:28,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:06:28,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 16:06:29,019 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 16:06:29,053 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 16:06:29,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:29,141 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 16:06:29,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:29,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 38 [2025-01-09 16:06:29,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:29,234 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 42 [2025-01-09 16:06:29,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:29,261 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 78 [2025-01-09 16:06:29,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:29,328 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 78 treesize of output 81 [2025-01-09 16:06:29,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:29,418 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 137 treesize of output 65 [2025-01-09 16:06:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-01-09 16:06:29,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:06:29,461 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:29,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630327413] [2025-01-09 16:06:29,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630327413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:29,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:29,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:06:29,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341705896] [2025-01-09 16:06:29,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:29,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:06:29,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:29,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:06:29,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:06:29,462 INFO L87 Difference]: Start difference. First operand 159 states and 202 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 16:06:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:30,559 INFO L93 Difference]: Finished difference Result 378 states and 475 transitions. [2025-01-09 16:06:30,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:06:30,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 139 [2025-01-09 16:06:30,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:30,561 INFO L225 Difference]: With dead ends: 378 [2025-01-09 16:06:30,561 INFO L226 Difference]: Without dead ends: 249 [2025-01-09 16:06:30,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:06:30,562 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 355 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:30,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 467 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 16:06:30,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-01-09 16:06:30,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 227. [2025-01-09 16:06:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 183 states have (on average 1.2185792349726776) internal successors, (223), 185 states have internal predecessors, (223), 34 states have call successors, (34), 9 states have call predecessors, (34), 9 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 16:06:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 291 transitions. [2025-01-09 16:06:30,587 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 291 transitions. Word has length 139 [2025-01-09 16:06:30,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:30,588 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 291 transitions. [2025-01-09 16:06:30,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 16:06:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 291 transitions. [2025-01-09 16:06:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 16:06:30,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:30,589 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:30,596 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 (17)] Forceful destruction successful, exit code 0 [2025-01-09 16:06:30,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:30,793 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:30,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:30,794 INFO L85 PathProgramCache]: Analyzing trace with hash 618054582, now seen corresponding path program 1 times [2025-01-09 16:06:30,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:30,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013905688] [2025-01-09 16:06:30,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:30,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:30,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:30,797 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:30,803 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 (18)] Waiting until timeout for monitored process [2025-01-09 16:06:30,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 16:06:31,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 16:06:31,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:31,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:31,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 16:06:31,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:31,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 16:06:31,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2025-01-09 16:06:31,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 34 [2025-01-09 16:06:31,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:31,419 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 16:06:31,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:31,603 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 50 treesize of output 40 [2025-01-09 16:06:31,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:31,711 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 77 treesize of output 63 [2025-01-09 16:06:31,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:31,821 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 80 treesize of output 70 [2025-01-09 16:06:31,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:31,906 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 80 treesize of output 70 [2025-01-09 16:06:32,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:32,093 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 96 treesize of output 87 [2025-01-09 16:06:32,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:32,203 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 101 treesize of output 41 [2025-01-09 16:06:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 370 proven. 42 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-01-09 16:06:32,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:06:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:06:32,810 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:32,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013905688] [2025-01-09 16:06:32,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013905688] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:06:32,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:06:32,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 20 [2025-01-09 16:06:32,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074903585] [2025-01-09 16:06:32,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:32,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:06:32,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:32,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:06:32,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:06:32,811 INFO L87 Difference]: Start difference. First operand 227 states and 291 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:33,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:33,228 INFO L93 Difference]: Finished difference Result 576 states and 733 transitions. [2025-01-09 16:06:33,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:06:33,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-01-09 16:06:33,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:33,230 INFO L225 Difference]: With dead ends: 576 [2025-01-09 16:06:33,230 INFO L226 Difference]: Without dead ends: 379 [2025-01-09 16:06:33,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2025-01-09 16:06:33,231 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 98 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:33,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 363 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:06:33,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-09 16:06:33,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 227. [2025-01-09 16:06:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 185 states have internal predecessors, (221), 34 states have call successors, (34), 9 states have call predecessors, (34), 9 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 16:06:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 289 transitions. [2025-01-09 16:06:33,271 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 289 transitions. Word has length 139 [2025-01-09 16:06:33,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:33,271 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 289 transitions. [2025-01-09 16:06:33,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 289 transitions. [2025-01-09 16:06:33,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 16:06:33,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:33,272 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:33,279 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 (18)] Forceful destruction successful, exit code 0 [2025-01-09 16:06:33,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:33,472 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:33,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:33,473 INFO L85 PathProgramCache]: Analyzing trace with hash -21831794, now seen corresponding path program 1 times [2025-01-09 16:06:33,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:33,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139444638] [2025-01-09 16:06:33,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:33,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:33,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:33,476 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:33,477 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 (19)] Waiting until timeout for monitored process [2025-01-09 16:06:33,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:06:33,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:06:33,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:33,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:33,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 16:06:33,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:33,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 16:06:33,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:06:33,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:06:33,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 16:06:33,784 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 16:06:33,806 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 16:06:33,832 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 16:06:33,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:33,887 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 16:06:33,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:33,938 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 16:06:33,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:33,985 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 67 treesize of output 68 [2025-01-09 16:06:34,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:34,047 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 75 treesize of output 74 [2025-01-09 16:06:34,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:34,083 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 75 treesize of output 74 [2025-01-09 16:06:34,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:34,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 99 treesize of output 122 [2025-01-09 16:06:34,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:34,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 187 treesize of output 85 [2025-01-09 16:06:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-01-09 16:06:34,289 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:06:34,289 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:34,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139444638] [2025-01-09 16:06:34,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139444638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:34,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:34,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:06:34,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792503830] [2025-01-09 16:06:34,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:34,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:06:34,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:34,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:06:34,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:06:34,292 INFO L87 Difference]: Start difference. First operand 227 states and 289 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 16:06:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:35,897 INFO L93 Difference]: Finished difference Result 517 states and 658 transitions. [2025-01-09 16:06:35,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:06:35,898 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 140 [2025-01-09 16:06:35,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:35,899 INFO L225 Difference]: With dead ends: 517 [2025-01-09 16:06:35,899 INFO L226 Difference]: Without dead ends: 320 [2025-01-09 16:06:35,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:06:35,900 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 236 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:35,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 582 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 16:06:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-01-09 16:06:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 237. [2025-01-09 16:06:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 193 states have (on average 1.2072538860103628) internal successors, (233), 195 states have internal predecessors, (233), 34 states have call successors, (34), 9 states have call predecessors, (34), 9 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 16:06:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 301 transitions. [2025-01-09 16:06:35,928 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 301 transitions. Word has length 140 [2025-01-09 16:06:35,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:35,928 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 301 transitions. [2025-01-09 16:06:35,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 16:06:35,928 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 301 transitions. [2025-01-09 16:06:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 16:06:35,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:35,930 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:35,939 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 (19)] Forceful destruction successful, exit code 0 [2025-01-09 16:06:36,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:36,134 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:36,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:36,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1610179696, now seen corresponding path program 1 times [2025-01-09 16:06:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674248331] [2025-01-09 16:06:36,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:36,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:36,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:36,137 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:36,139 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 (20)] Waiting until timeout for monitored process [2025-01-09 16:06:36,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:06:36,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:06:36,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:36,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:36,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:06:36,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:36,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-09 16:06:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:06:36,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:06:36,385 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:36,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674248331] [2025-01-09 16:06:36,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674248331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:36,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:36,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:06:36,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542300176] [2025-01-09 16:06:36,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:36,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:06:36,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:36,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:06:36,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:06:36,387 INFO L87 Difference]: Start difference. First operand 237 states and 301 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:37,631 INFO L93 Difference]: Finished difference Result 444 states and 562 transitions. [2025-01-09 16:06:37,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:06:37,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-01-09 16:06:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:37,633 INFO L225 Difference]: With dead ends: 444 [2025-01-09 16:06:37,633 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 16:06:37,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:06:37,634 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 106 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:37,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 220 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 16:06:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 16:06:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-01-09 16:06:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 193 states have (on average 1.1865284974093264) internal successors, (229), 195 states have internal predecessors, (229), 34 states have call successors, (34), 9 states have call predecessors, (34), 9 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 16:06:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 297 transitions. [2025-01-09 16:06:37,678 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 297 transitions. Word has length 140 [2025-01-09 16:06:37,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:37,678 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 297 transitions. [2025-01-09 16:06:37,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 297 transitions. [2025-01-09 16:06:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 16:06:37,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:37,680 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:37,687 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 (20)] Ended with exit code 0 [2025-01-09 16:06:37,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:37,881 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:37,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:37,881 INFO L85 PathProgramCache]: Analyzing trace with hash 400870032, now seen corresponding path program 1 times [2025-01-09 16:06:37,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:37,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686475015] [2025-01-09 16:06:37,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:37,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:37,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:37,884 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:37,884 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 (21)] Waiting until timeout for monitored process [2025-01-09 16:06:37,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:06:38,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:06:38,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:38,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:38,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:06:38,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:38,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-09 16:06:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 16:06:38,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:06:38,092 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:38,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686475015] [2025-01-09 16:06:38,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686475015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:38,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:38,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:06:38,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739971146] [2025-01-09 16:06:38,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:38,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:06:38,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:38,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:06:38,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:06:38,093 INFO L87 Difference]: Start difference. First operand 237 states and 297 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:06:39,658 INFO L93 Difference]: Finished difference Result 428 states and 536 transitions. [2025-01-09 16:06:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:06:39,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 140 [2025-01-09 16:06:39,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:06:39,661 INFO L225 Difference]: With dead ends: 428 [2025-01-09 16:06:39,661 INFO L226 Difference]: Without dead ends: 221 [2025-01-09 16:06:39,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:06:39,661 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 108 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:06:39,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 210 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 16:06:39,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-01-09 16:06:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-01-09 16:06:39,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 177 states have (on average 1.1807909604519775) internal successors, (209), 179 states have internal predecessors, (209), 34 states have call successors, (34), 9 states have call predecessors, (34), 9 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 16:06:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 277 transitions. [2025-01-09 16:06:39,692 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 277 transitions. Word has length 140 [2025-01-09 16:06:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:06:39,692 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 277 transitions. [2025-01-09 16:06:39,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-01-09 16:06:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 277 transitions. [2025-01-09 16:06:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 16:06:39,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:06:39,693 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:06:39,701 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 (21)] Ended with exit code 0 [2025-01-09 16:06:39,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:39,894 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:06:39,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:06:39,894 INFO L85 PathProgramCache]: Analyzing trace with hash 974295629, now seen corresponding path program 1 times [2025-01-09 16:06:39,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:06:39,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572402236] [2025-01-09 16:06:39,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:06:39,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 16:06:39,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:06:39,897 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 16:06:39,898 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 (22)] Waiting until timeout for monitored process [2025-01-09 16:06:39,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 16:06:40,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 16:06:40,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:06:40,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:06:40,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 16:06:40,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:06:40,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 16:06:40,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:06:40,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:06:40,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-01-09 16:06:40,156 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 16:06:40,181 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 16:06:40,206 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 16:06:40,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:40,268 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 16:06:40,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:40,318 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 16:06:40,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:40,366 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 64 treesize of output 47 [2025-01-09 16:06:40,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:40,405 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 57 treesize of output 50 [2025-01-09 16:06:40,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:40,520 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 73 treesize of output 67 [2025-01-09 16:06:40,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:06:40,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 78 treesize of output 30 [2025-01-09 16:06:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-01-09 16:06:40,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:06:40,631 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:06:40,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572402236] [2025-01-09 16:06:40,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572402236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:06:40,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:06:40,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:06:40,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330445167] [2025-01-09 16:06:40,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:06:40,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:06:40,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:06:40,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:06:40,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:06:40,632 INFO L87 Difference]: Start difference. First operand 221 states and 277 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 16:06:43,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:06:45,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 16:06:48,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]