./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-79.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-79.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 f7fc08b588cf858e0c335544f00bb02bd00acd3c7c4757ecff13aa4df92c2d34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:03:12,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:03:12,200 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:03:12,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:03:12,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:03:12,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:03:12,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:03:12,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:03:12,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:03:12,235 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:03:12,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:03:12,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:03:12,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:03:12,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:03:12,236 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:03:12,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:03:12,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:03:12,236 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:03:12,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:03:12,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:03:12,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:03:12,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:03:12,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:03:12,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:03:12,236 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:03:12,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:03:12,236 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:03:12,236 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:03:12,236 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:03:12,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:03:12,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:03:12,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:03:12,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:12,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:03:12,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:03:12,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:03:12,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:03:12,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:12,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:03:12,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:03:12,238 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:03:12,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:03:12,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:03:12,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:03:12,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:03:12,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:03:12,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:03:12,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:03:12,242 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 -> f7fc08b588cf858e0c335544f00bb02bd00acd3c7c4757ecff13aa4df92c2d34 [2025-01-09 16:03:12,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:03:12,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:03:12,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:03:12,517 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:03:12,517 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:03:12,518 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-79.i [2025-01-09 16:03:13,743 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee33e55e6/331def913445440bbc1fbf86c7c7d33c/FLAG093d44822 [2025-01-09 16:03:13,986 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:03:13,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-79.i [2025-01-09 16:03:13,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee33e55e6/331def913445440bbc1fbf86c7c7d33c/FLAG093d44822 [2025-01-09 16:03:14,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee33e55e6/331def913445440bbc1fbf86c7c7d33c [2025-01-09 16:03:14,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:03:14,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:03:14,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:03:14,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:03:14,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:03:14,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:14" (1/1) ... [2025-01-09 16:03:14,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@649a78e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:14, skipping insertion in model container [2025-01-09 16:03:14,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:14" (1/1) ... [2025-01-09 16:03:14,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:03:14,139 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-79.i[916,929] [2025-01-09 16:03:14,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:14,194 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:03:14,202 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-79.i[916,929] [2025-01-09 16:03:14,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:14,254 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:03:14,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:14 WrapperNode [2025-01-09 16:03:14,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:03:14,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:14,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:03:14,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:03:14,262 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:03:14" (1/1) ... [2025-01-09 16:03:14,269 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:03:14" (1/1) ... [2025-01-09 16:03:14,289 INFO L138 Inliner]: procedures = 30, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 402 [2025-01-09 16:03:14,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:14,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:03:14,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:03:14,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:03:14,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:14" (1/1) ... [2025-01-09 16:03:14,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:14" (1/1) ... [2025-01-09 16:03:14,301 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:14" (1/1) ... [2025-01-09 16:03:14,308 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 16:03:14,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:14" (1/1) ... [2025-01-09 16:03:14,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:14" (1/1) ... [2025-01-09 16:03:14,321 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:14" (1/1) ... [2025-01-09 16:03:14,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:14" (1/1) ... [2025-01-09 16:03:14,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:14" (1/1) ... [2025-01-09 16:03:14,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:14" (1/1) ... [2025-01-09 16:03:14,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:14" (1/1) ... [2025-01-09 16:03:14,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:03:14,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:03:14,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:03:14,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:03:14,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:14" (1/1) ... [2025-01-09 16:03:14,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:14,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:14,385 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:03:14,392 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:03:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:03:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 16:03:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 16:03:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 16:03:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 16:03:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 16:03:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 16:03:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:03:14,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:03:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 16:03:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:03:14,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:03:14,495 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:03:14,497 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:03:14,845 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-01-09 16:03:14,845 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:03:14,859 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:03:14,859 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:03:14,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:14 BoogieIcfgContainer [2025-01-09 16:03:14,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:03:14,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:03:14,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:03:14,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:03:14,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:03:14" (1/3) ... [2025-01-09 16:03:14,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55afa1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:14, skipping insertion in model container [2025-01-09 16:03:14,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:14" (2/3) ... [2025-01-09 16:03:14,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55afa1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:14, skipping insertion in model container [2025-01-09 16:03:14,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:14" (3/3) ... [2025-01-09 16:03:14,870 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-79.i [2025-01-09 16:03:14,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:03:14,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-79.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:03:14,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:03:14,943 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;@3767d3d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:03:14,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:03:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:14,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:03:14,960 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:14,960 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:14,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:14,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:14,969 INFO L85 PathProgramCache]: Analyzing trace with hash 492669663, now seen corresponding path program 1 times [2025-01-09 16:03:14,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:14,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924242572] [2025-01-09 16:03:14,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:14,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:15,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:03:15,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:03:15,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:15,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 16:03:15,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:15,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924242572] [2025-01-09 16:03:15,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924242572] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:03:15,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210763547] [2025-01-09 16:03:15,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:15,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:15,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:15,179 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:03:15,183 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:03:15,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:03:15,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:03:15,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:15,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:15,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:03:15,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 16:03:15,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:15,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210763547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:15,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:03:15,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 16:03:15,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798448606] [2025-01-09 16:03:15,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:15,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:03:15,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:15,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:03:15,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:03:15,377 INFO L87 Difference]: Start difference. First operand has 94 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:15,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:15,392 INFO L93 Difference]: Finished difference Result 182 states and 278 transitions. [2025-01-09 16:03:15,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:03:15,394 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2025-01-09 16:03:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:15,397 INFO L225 Difference]: With dead ends: 182 [2025-01-09 16:03:15,397 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 16:03:15,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:03:15,401 INFO L435 NwaCegarLoop]: 131 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, 131 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:03:15,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 16:03:15,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 16:03:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:15,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2025-01-09 16:03:15,423 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 101 [2025-01-09 16:03:15,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:15,424 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2025-01-09 16:03:15,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2025-01-09 16:03:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:03:15,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:15,426 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:15,436 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:03:15,627 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:03:15,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:15,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:15,628 INFO L85 PathProgramCache]: Analyzing trace with hash -255742183, now seen corresponding path program 1 times [2025-01-09 16:03:15,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:15,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353787288] [2025-01-09 16:03:15,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:15,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:15,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:03:15,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:03:15,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:15,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:15,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:15,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353787288] [2025-01-09 16:03:15,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353787288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:15,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:15,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:03:15,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124314665] [2025-01-09 16:03:15,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:15,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:15,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:15,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:15,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:15,918 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:15,956 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2025-01-09 16:03:15,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:15,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2025-01-09 16:03:15,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:15,959 INFO L225 Difference]: With dead ends: 181 [2025-01-09 16:03:15,959 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 16:03:15,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:15,960 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 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:03:15,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:15,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 16:03:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 16:03:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2025-01-09 16:03:15,974 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 101 [2025-01-09 16:03:15,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:15,978 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2025-01-09 16:03:15,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2025-01-09 16:03:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:03:15,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:15,980 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:15,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:03:15,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:15,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:15,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1772843927, now seen corresponding path program 1 times [2025-01-09 16:03:15,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:15,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330616114] [2025-01-09 16:03:15,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:15,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:16,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:03:16,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:03:16,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:16,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 16:03:16,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:16,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330616114] [2025-01-09 16:03:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330616114] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:03:16,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685242624] [2025-01-09 16:03:16,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:16,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:16,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:16,280 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:03:16,281 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:03:16,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:03:16,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:03:16,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:16,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:16,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:03:16,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:16,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:16,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685242624] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:16,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:03:16,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 16:03:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064584000] [2025-01-09 16:03:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:16,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:16,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:16,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:16,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:03:16,444 INFO L87 Difference]: Start difference. First operand 93 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:16,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:16,478 INFO L93 Difference]: Finished difference Result 186 states and 267 transitions. [2025-01-09 16:03:16,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:16,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2025-01-09 16:03:16,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:16,479 INFO L225 Difference]: With dead ends: 186 [2025-01-09 16:03:16,479 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 16:03:16,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 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:03:16,482 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:16,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 375 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:16,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 16:03:16,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-01-09 16:03:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2025-01-09 16:03:16,492 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 101 [2025-01-09 16:03:16,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:16,492 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2025-01-09 16:03:16,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2025-01-09 16:03:16,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 16:03:16,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:16,493 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:16,501 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:03:16,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:16,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:16,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:16,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1774690969, now seen corresponding path program 1 times [2025-01-09 16:03:16,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:16,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729907450] [2025-01-09 16:03:16,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:16,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:16,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:03:16,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:03:16,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:16,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 16:03:16,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:16,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729907450] [2025-01-09 16:03:16,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729907450] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:03:16,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962824006] [2025-01-09 16:03:16,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:16,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:16,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:16,893 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:03:16,894 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:03:16,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 16:03:17,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 16:03:17,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:17,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:17,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:03:17,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:17,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:17,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962824006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:17,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:03:17,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 16:03:17,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396948329] [2025-01-09 16:03:17,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:17,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:17,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:17,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:17,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:03:17,043 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:17,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:17,059 INFO L93 Difference]: Finished difference Result 189 states and 270 transitions. [2025-01-09 16:03:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:17,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2025-01-09 16:03:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:17,060 INFO L225 Difference]: With dead ends: 189 [2025-01-09 16:03:17,060 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 16:03:17,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 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:03:17,061 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 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:03:17,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:17,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 16:03:17,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 16:03:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 137 transitions. [2025-01-09 16:03:17,065 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 137 transitions. Word has length 101 [2025-01-09 16:03:17,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:17,065 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 137 transitions. [2025-01-09 16:03:17,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 137 transitions. [2025-01-09 16:03:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:03:17,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:17,066 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:17,073 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:03:17,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:17,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:17,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:17,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1574302252, now seen corresponding path program 1 times [2025-01-09 16:03:17,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:17,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3152087] [2025-01-09 16:03:17,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:17,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:17,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:03:17,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:03:17,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:17,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:17,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:17,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3152087] [2025-01-09 16:03:17,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3152087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:17,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:17,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:03:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603698297] [2025-01-09 16:03:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:17,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:03:17,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:17,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:03:17,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:03:17,533 INFO L87 Difference]: Start difference. First operand 97 states and 137 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:17,857 INFO L93 Difference]: Finished difference Result 275 states and 389 transitions. [2025-01-09 16:03:17,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:03:17,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-01-09 16:03:17,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:17,859 INFO L225 Difference]: With dead ends: 275 [2025-01-09 16:03:17,861 INFO L226 Difference]: Without dead ends: 181 [2025-01-09 16:03:17,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:03:17,862 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 100 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:17,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 537 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:03:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-01-09 16:03:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 99. [2025-01-09 16:03:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2025-01-09 16:03:17,874 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 103 [2025-01-09 16:03:17,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:17,874 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2025-01-09 16:03:17,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:17,874 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2025-01-09 16:03:17,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:03:17,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:17,875 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:17,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:03:17,875 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:17,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:17,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1710494947, now seen corresponding path program 1 times [2025-01-09 16:03:17,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:17,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914662968] [2025-01-09 16:03:17,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:17,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:17,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:03:17,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:03:17,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:17,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:19,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:19,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914662968] [2025-01-09 16:03:19,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914662968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:19,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:19,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:03:19,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394564458] [2025-01-09 16:03:19,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:19,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:03:19,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:19,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:03:19,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:03:19,224 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:20,036 INFO L93 Difference]: Finished difference Result 502 states and 697 transitions. [2025-01-09 16:03:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 16:03:20,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2025-01-09 16:03:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:20,039 INFO L225 Difference]: With dead ends: 502 [2025-01-09 16:03:20,039 INFO L226 Difference]: Without dead ends: 406 [2025-01-09 16:03:20,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2025-01-09 16:03:20,040 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 524 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:20,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 745 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:03:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-01-09 16:03:20,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 211. [2025-01-09 16:03:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 186 states have (on average 1.39247311827957) internal successors, (259), 186 states have internal predecessors, (259), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 16:03:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 303 transitions. [2025-01-09 16:03:20,055 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 303 transitions. Word has length 104 [2025-01-09 16:03:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:20,056 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 303 transitions. [2025-01-09 16:03:20,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 303 transitions. [2025-01-09 16:03:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 16:03:20,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:20,057 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:20,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:03:20,057 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:20,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:20,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2040212912, now seen corresponding path program 1 times [2025-01-09 16:03:20,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:20,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263123361] [2025-01-09 16:03:20,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:20,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 16:03:20,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 16:03:20,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:20,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263123361] [2025-01-09 16:03:20,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263123361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:20,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:20,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:03:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343142650] [2025-01-09 16:03:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:20,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:03:20,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:20,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:03:20,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:03:20,951 INFO L87 Difference]: Start difference. First operand 211 states and 303 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:21,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:21,238 INFO L93 Difference]: Finished difference Result 495 states and 706 transitions. [2025-01-09 16:03:21,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:03:21,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2025-01-09 16:03:21,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:21,241 INFO L225 Difference]: With dead ends: 495 [2025-01-09 16:03:21,241 INFO L226 Difference]: Without dead ends: 287 [2025-01-09 16:03:21,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:03:21,242 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 44 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:21,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 627 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:03:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-01-09 16:03:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 103. [2025-01-09 16:03:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 90 states have internal predecessors, (123), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2025-01-09 16:03:21,255 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 105 [2025-01-09 16:03:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:21,256 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2025-01-09 16:03:21,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2025-01-09 16:03:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 16:03:21,257 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:21,257 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:21,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:03:21,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:21,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:21,258 INFO L85 PathProgramCache]: Analyzing trace with hash 298739511, now seen corresponding path program 1 times [2025-01-09 16:03:21,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:21,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969585244] [2025-01-09 16:03:21,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:21,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:21,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:03:21,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:03:21,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:21,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:21,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:21,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969585244] [2025-01-09 16:03:21,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969585244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:21,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:21,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:03:21,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177871309] [2025-01-09 16:03:21,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:21,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:03:21,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:21,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:03:21,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:03:21,509 INFO L87 Difference]: Start difference. First operand 103 states and 145 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:21,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:21,672 INFO L93 Difference]: Finished difference Result 268 states and 375 transitions. [2025-01-09 16:03:21,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:03:21,673 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-01-09 16:03:21,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:21,674 INFO L225 Difference]: With dead ends: 268 [2025-01-09 16:03:21,674 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 16:03:21,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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:03:21,675 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 57 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:21,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 515 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:03:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 16:03:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2025-01-09 16:03:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 147 states have (on average 1.3605442176870748) internal successors, (200), 148 states have internal predecessors, (200), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:03:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 230 transitions. [2025-01-09 16:03:21,685 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 230 transitions. Word has length 106 [2025-01-09 16:03:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:21,685 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 230 transitions. [2025-01-09 16:03:21,685 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 230 transitions. [2025-01-09 16:03:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 16:03:21,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:21,689 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:21,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:03:21,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:21,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash 748087799, now seen corresponding path program 1 times [2025-01-09 16:03:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:21,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279596153] [2025-01-09 16:03:21,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:21,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:21,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:03:21,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:03:21,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:21,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:21,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:21,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279596153] [2025-01-09 16:03:21,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279596153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:21,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:21,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:03:21,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665314846] [2025-01-09 16:03:21,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:21,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:03:21,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:21,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:03:21,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:03:21,990 INFO L87 Difference]: Start difference. First operand 165 states and 230 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:22,447 INFO L93 Difference]: Finished difference Result 829 states and 1148 transitions. [2025-01-09 16:03:22,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:03:22,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-01-09 16:03:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:22,451 INFO L225 Difference]: With dead ends: 829 [2025-01-09 16:03:22,451 INFO L226 Difference]: Without dead ends: 667 [2025-01-09 16:03:22,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:03:22,452 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 520 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:22,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 437 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:03:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-01-09 16:03:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 410. [2025-01-09 16:03:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 375 states have (on average 1.392) internal successors, (522), 377 states have internal predecessors, (522), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 582 transitions. [2025-01-09 16:03:22,492 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 582 transitions. Word has length 106 [2025-01-09 16:03:22,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:22,492 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 582 transitions. [2025-01-09 16:03:22,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:22,493 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 582 transitions. [2025-01-09 16:03:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 16:03:22,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:22,495 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:22,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:03:22,495 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:22,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:22,496 INFO L85 PathProgramCache]: Analyzing trace with hash 161281785, now seen corresponding path program 1 times [2025-01-09 16:03:22,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:22,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286734475] [2025-01-09 16:03:22,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:22,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:22,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:03:22,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:03:22,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:22,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:22,635 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:22,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:22,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286734475] [2025-01-09 16:03:22,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286734475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:22,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:22,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:03:22,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760600239] [2025-01-09 16:03:22,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:22,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:22,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:22,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:22,638 INFO L87 Difference]: Start difference. First operand 410 states and 582 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:22,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:22,834 INFO L93 Difference]: Finished difference Result 803 states and 1143 transitions. [2025-01-09 16:03:22,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:22,837 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-01-09 16:03:22,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:22,839 INFO L225 Difference]: With dead ends: 803 [2025-01-09 16:03:22,839 INFO L226 Difference]: Without dead ends: 396 [2025-01-09 16:03:22,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:22,840 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:22,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:03:22,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-01-09 16:03:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 371. [2025-01-09 16:03:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 336 states have (on average 1.3422619047619047) internal successors, (451), 338 states have internal predecessors, (451), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:22,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 511 transitions. [2025-01-09 16:03:22,853 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 511 transitions. Word has length 106 [2025-01-09 16:03:22,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:22,853 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 511 transitions. [2025-01-09 16:03:22,853 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 511 transitions. [2025-01-09 16:03:22,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 16:03:22,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:22,854 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:22,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:03:22,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:22,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1219048899, now seen corresponding path program 1 times [2025-01-09 16:03:22,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:22,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383329338] [2025-01-09 16:03:22,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:22,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:22,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:03:22,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:03:22,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:22,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:23,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:23,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383329338] [2025-01-09 16:03:23,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383329338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:23,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:23,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:03:23,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290593425] [2025-01-09 16:03:23,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:23,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:03:23,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:23,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:03:23,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:03:23,125 INFO L87 Difference]: Start difference. First operand 371 states and 511 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:23,571 INFO L93 Difference]: Finished difference Result 955 states and 1301 transitions. [2025-01-09 16:03:23,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:03:23,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-01-09 16:03:23,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:23,576 INFO L225 Difference]: With dead ends: 955 [2025-01-09 16:03:23,576 INFO L226 Difference]: Without dead ends: 587 [2025-01-09 16:03:23,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:03:23,577 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 379 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:23,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 423 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:03:23,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-01-09 16:03:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 382. [2025-01-09 16:03:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 347 states have (on average 1.3429394812680115) internal successors, (466), 349 states have internal predecessors, (466), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 526 transitions. [2025-01-09 16:03:23,591 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 526 transitions. Word has length 106 [2025-01-09 16:03:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:23,591 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 526 transitions. [2025-01-09 16:03:23,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 526 transitions. [2025-01-09 16:03:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 16:03:23,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:23,592 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:23,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:03:23,593 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:23,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:23,593 INFO L85 PathProgramCache]: Analyzing trace with hash 197980545, now seen corresponding path program 1 times [2025-01-09 16:03:23,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:23,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802791405] [2025-01-09 16:03:23,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:23,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:23,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 16:03:23,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 16:03:23,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:23,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:23,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:23,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802791405] [2025-01-09 16:03:23,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802791405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:23,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:23,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:03:23,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332081736] [2025-01-09 16:03:23,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:23,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:23,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:23,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:23,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:23,685 INFO L87 Difference]: Start difference. First operand 382 states and 526 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:23,757 INFO L93 Difference]: Finished difference Result 711 states and 983 transitions. [2025-01-09 16:03:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:23,757 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 106 [2025-01-09 16:03:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:23,759 INFO L225 Difference]: With dead ends: 711 [2025-01-09 16:03:23,759 INFO L226 Difference]: Without dead ends: 332 [2025-01-09 16:03:23,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:23,760 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:23,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:03:23,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-01-09 16:03:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 323. [2025-01-09 16:03:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 288 states have (on average 1.3159722222222223) internal successors, (379), 290 states have internal predecessors, (379), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 439 transitions. [2025-01-09 16:03:23,771 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 439 transitions. Word has length 106 [2025-01-09 16:03:23,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:23,771 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 439 transitions. [2025-01-09 16:03:23,771 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:23,771 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 439 transitions. [2025-01-09 16:03:23,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 16:03:23,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:23,772 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:23,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:03:23,773 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:23,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash -609161259, now seen corresponding path program 1 times [2025-01-09 16:03:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:23,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198224324] [2025-01-09 16:03:23,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:23,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:23,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 16:03:23,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 16:03:23,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:23,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 16:03:23,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:23,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198224324] [2025-01-09 16:03:23,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198224324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:23,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:23,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:03:23,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771307698] [2025-01-09 16:03:23,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:23,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:03:23,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:23,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:03:23,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:03:23,978 INFO L87 Difference]: Start difference. First operand 323 states and 439 transitions. Second operand has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:24,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:24,210 INFO L93 Difference]: Finished difference Result 643 states and 873 transitions. [2025-01-09 16:03:24,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:03:24,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2025-01-09 16:03:24,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:24,212 INFO L225 Difference]: With dead ends: 643 [2025-01-09 16:03:24,212 INFO L226 Difference]: Without dead ends: 323 [2025-01-09 16:03:24,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:03:24,213 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 85 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:24,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 264 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:03:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-01-09 16:03:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2025-01-09 16:03:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 282 states have (on average 1.301418439716312) internal successors, (367), 284 states have internal predecessors, (367), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 427 transitions. [2025-01-09 16:03:24,226 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 427 transitions. Word has length 107 [2025-01-09 16:03:24,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:24,226 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 427 transitions. [2025-01-09 16:03:24,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:24,226 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 427 transitions. [2025-01-09 16:03:24,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 16:03:24,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:24,227 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:24,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:03:24,227 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:24,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash -648862608, now seen corresponding path program 1 times [2025-01-09 16:03:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:24,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733556934] [2025-01-09 16:03:24,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:24,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:03:24,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:03:24,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:24,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:24,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:24,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733556934] [2025-01-09 16:03:24,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733556934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:24,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:24,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:03:24,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107012125] [2025-01-09 16:03:24,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:24,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:03:24,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:24,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:03:24,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:03:24,543 INFO L87 Difference]: Start difference. First operand 319 states and 427 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:24,780 INFO L93 Difference]: Finished difference Result 635 states and 851 transitions. [2025-01-09 16:03:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:03:24,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-01-09 16:03:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:24,782 INFO L225 Difference]: With dead ends: 635 [2025-01-09 16:03:24,782 INFO L226 Difference]: Without dead ends: 319 [2025-01-09 16:03:24,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:03:24,783 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 103 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:24,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 182 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:03:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-01-09 16:03:24,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2025-01-09 16:03:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 282 states have (on average 1.2801418439716312) internal successors, (361), 284 states have internal predecessors, (361), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 421 transitions. [2025-01-09 16:03:24,803 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 421 transitions. Word has length 108 [2025-01-09 16:03:24,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:24,803 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 421 transitions. [2025-01-09 16:03:24,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:24,804 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 421 transitions. [2025-01-09 16:03:24,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 16:03:24,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:24,805 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:24,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:03:24,805 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:24,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:24,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1154540587, now seen corresponding path program 1 times [2025-01-09 16:03:24,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:24,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161648761] [2025-01-09 16:03:24,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:24,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:24,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:03:24,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:03:24,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:24,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:03:24,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [812685495] [2025-01-09 16:03:24,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:24,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:24,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:24,864 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:03:24,865 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:03:24,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:03:25,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:03:25,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:25,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:25,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-01-09 16:03:25,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:25,147 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:03:25,154 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:03:25,159 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:03:25,163 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:03:25,167 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:03:25,171 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:03:25,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:25,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2025-01-09 16:03:25,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:25,246 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 39 treesize of output 44 [2025-01-09 16:03:25,277 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 114 treesize of output 86 [2025-01-09 16:03:25,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:25,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 136 [2025-01-09 16:03:25,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:03:25,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 65 [2025-01-09 16:03:25,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:25,624 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 152 treesize of output 60 [2025-01-09 16:03:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:25,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:25,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:25,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161648761] [2025-01-09 16:03:25,662 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:03:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812685495] [2025-01-09 16:03:25,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812685495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:25,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:25,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:03:25,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214114067] [2025-01-09 16:03:25,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:25,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:03:25,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:25,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:03:25,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:03:25,663 INFO L87 Difference]: Start difference. First operand 319 states and 421 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:26,271 INFO L93 Difference]: Finished difference Result 812 states and 1076 transitions. [2025-01-09 16:03:26,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:03:26,272 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-01-09 16:03:26,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:26,273 INFO L225 Difference]: With dead ends: 812 [2025-01-09 16:03:26,273 INFO L226 Difference]: Without dead ends: 496 [2025-01-09 16:03:26,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:03:26,274 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 104 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:26,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 697 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:03:26,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-09 16:03:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 399. [2025-01-09 16:03:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 362 states have (on average 1.2790055248618784) internal successors, (463), 364 states have internal predecessors, (463), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:26,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 523 transitions. [2025-01-09 16:03:26,288 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 523 transitions. Word has length 110 [2025-01-09 16:03:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:26,289 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 523 transitions. [2025-01-09 16:03:26,289 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 523 transitions. [2025-01-09 16:03:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 16:03:26,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:26,290 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:26,298 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:03:26,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 16:03:26,494 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:26,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:26,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1741346601, now seen corresponding path program 1 times [2025-01-09 16:03:26,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:26,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262081315] [2025-01-09 16:03:26,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:26,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:26,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:03:26,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:03:26,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:26,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:26,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:26,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262081315] [2025-01-09 16:03:26,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262081315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:26,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:26,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:03:26,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435836054] [2025-01-09 16:03:26,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:26,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:03:26,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:26,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:03:26,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:03:26,803 INFO L87 Difference]: Start difference. First operand 399 states and 523 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:26,983 INFO L93 Difference]: Finished difference Result 910 states and 1191 transitions. [2025-01-09 16:03:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:03:26,984 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-01-09 16:03:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:26,986 INFO L225 Difference]: With dead ends: 910 [2025-01-09 16:03:26,986 INFO L226 Difference]: Without dead ends: 514 [2025-01-09 16:03:26,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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:03:26,987 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 35 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:26,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 310 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:03:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-09 16:03:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 440. [2025-01-09 16:03:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 403 states have (on average 1.250620347394541) internal successors, (504), 405 states have internal predecessors, (504), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 564 transitions. [2025-01-09 16:03:27,001 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 564 transitions. Word has length 110 [2025-01-09 16:03:27,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:27,001 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 564 transitions. [2025-01-09 16:03:27,001 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 564 transitions. [2025-01-09 16:03:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 16:03:27,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:27,002 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:27,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:03:27,002 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:27,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:27,003 INFO L85 PathProgramCache]: Analyzing trace with hash 231662807, now seen corresponding path program 1 times [2025-01-09 16:03:27,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:27,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408525223] [2025-01-09 16:03:27,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:27,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:27,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:03:27,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:03:27,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:27,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:27,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:27,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408525223] [2025-01-09 16:03:27,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408525223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:27,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:27,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:03:27,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641923030] [2025-01-09 16:03:27,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:27,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:03:27,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:27,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:03:27,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:03:27,285 INFO L87 Difference]: Start difference. First operand 440 states and 564 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:27,514 INFO L93 Difference]: Finished difference Result 951 states and 1222 transitions. [2025-01-09 16:03:27,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:03:27,515 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-01-09 16:03:27,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:27,516 INFO L225 Difference]: With dead ends: 951 [2025-01-09 16:03:27,516 INFO L226 Difference]: Without dead ends: 514 [2025-01-09 16:03:27,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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:03:27,517 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 33 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:27,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 376 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:03:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-09 16:03:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 440. [2025-01-09 16:03:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 403 states have (on average 1.2406947890818858) internal successors, (500), 405 states have internal predecessors, (500), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 560 transitions. [2025-01-09 16:03:27,532 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 560 transitions. Word has length 110 [2025-01-09 16:03:27,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:27,533 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 560 transitions. [2025-01-09 16:03:27,533 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:27,533 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 560 transitions. [2025-01-09 16:03:27,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 16:03:27,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:27,534 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:27,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:03:27,534 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:27,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:27,535 INFO L85 PathProgramCache]: Analyzing trace with hash -355143207, now seen corresponding path program 1 times [2025-01-09 16:03:27,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:27,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40547196] [2025-01-09 16:03:27,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:27,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:27,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:03:27,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:03:27,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:27,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:03:27,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531683060] [2025-01-09 16:03:27,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:27,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:27,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:27,577 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:03:27,578 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:03:27,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 16:03:27,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 16:03:27,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:27,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:27,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 16:03:27,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:27,796 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:03:27,800 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:03:27,803 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:03:27,805 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:03:27,809 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:03:27,811 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:03:27,855 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 35 treesize of output 19 [2025-01-09 16:03:27,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:27,868 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:03:27,895 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 110 treesize of output 84 [2025-01-09 16:03:27,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:27,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 124 [2025-01-09 16:03:27,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 61 [2025-01-09 16:03:28,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:28,231 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 135 treesize of output 61 [2025-01-09 16:03:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:28,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:28,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:28,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40547196] [2025-01-09 16:03:28,279 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:03:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531683060] [2025-01-09 16:03:28,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531683060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:28,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:28,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:03:28,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008374497] [2025-01-09 16:03:28,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:28,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:03:28,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:28,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:03:28,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:03:28,280 INFO L87 Difference]: Start difference. First operand 440 states and 560 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:28,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:28,811 INFO L93 Difference]: Finished difference Result 1032 states and 1317 transitions. [2025-01-09 16:03:28,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:03:28,811 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-01-09 16:03:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:28,813 INFO L225 Difference]: With dead ends: 1032 [2025-01-09 16:03:28,813 INFO L226 Difference]: Without dead ends: 595 [2025-01-09 16:03:28,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:03:28,814 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 72 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:28,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 739 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:03:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-01-09 16:03:28,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 497. [2025-01-09 16:03:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 460 states have (on average 1.2347826086956522) internal successors, (568), 462 states have internal predecessors, (568), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 628 transitions. [2025-01-09 16:03:28,830 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 628 transitions. Word has length 110 [2025-01-09 16:03:28,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:28,830 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 628 transitions. [2025-01-09 16:03:28,830 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:28,830 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 628 transitions. [2025-01-09 16:03:28,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 16:03:28,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:28,831 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:28,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 16:03:29,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 16:03:29,032 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:29,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:29,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1828678056, now seen corresponding path program 1 times [2025-01-09 16:03:29,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:29,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723000732] [2025-01-09 16:03:29,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:29,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:29,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:03:29,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:03:29,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:29,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:03:29,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1815395093] [2025-01-09 16:03:29,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:29,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:29,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:29,072 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:03:29,074 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:03:29,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:03:29,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:03:29,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:29,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:29,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-01-09 16:03:29,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:29,333 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:03:29,335 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:03:29,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:03:29,338 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:03:29,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 16:03:29,342 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:03:29,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:29,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-01-09 16:03:29,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:29,387 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 41 treesize of output 46 [2025-01-09 16:03:29,410 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 116 treesize of output 88 [2025-01-09 16:03:29,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:29,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 138 [2025-01-09 16:03:29,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:03:29,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 65 [2025-01-09 16:03:29,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:29,747 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 156 treesize of output 64 [2025-01-09 16:03:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:29,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:29,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:29,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723000732] [2025-01-09 16:03:29,788 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:03:29,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815395093] [2025-01-09 16:03:29,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815395093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:29,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:29,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:03:29,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595951025] [2025-01-09 16:03:29,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:29,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:03:29,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:29,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:03:29,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:03:29,790 INFO L87 Difference]: Start difference. First operand 497 states and 628 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:30,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:30,408 INFO L93 Difference]: Finished difference Result 1070 states and 1352 transitions. [2025-01-09 16:03:30,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:03:30,409 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-01-09 16:03:30,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:30,411 INFO L225 Difference]: With dead ends: 1070 [2025-01-09 16:03:30,411 INFO L226 Difference]: Without dead ends: 576 [2025-01-09 16:03:30,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:03:30,412 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 60 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:30,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 594 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 16:03:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-01-09 16:03:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 528. [2025-01-09 16:03:30,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 491 states have (on average 1.230142566191446) internal successors, (604), 493 states have internal predecessors, (604), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 664 transitions. [2025-01-09 16:03:30,431 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 664 transitions. Word has length 111 [2025-01-09 16:03:30,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:30,431 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 664 transitions. [2025-01-09 16:03:30,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 664 transitions. [2025-01-09 16:03:30,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 16:03:30,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:30,432 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:30,443 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:03:30,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:30,637 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:30,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:30,638 INFO L85 PathProgramCache]: Analyzing trace with hash -606565821, now seen corresponding path program 1 times [2025-01-09 16:03:30,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:30,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257705445] [2025-01-09 16:03:30,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:30,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:30,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:03:30,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:03:30,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:30,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:31,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:31,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257705445] [2025-01-09 16:03:31,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257705445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:31,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:31,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:03:31,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859971858] [2025-01-09 16:03:31,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:31,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:03:31,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:31,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:03:31,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:03:31,030 INFO L87 Difference]: Start difference. First operand 528 states and 664 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:31,258 INFO L93 Difference]: Finished difference Result 542 states and 681 transitions. [2025-01-09 16:03:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:03:31,258 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-01-09 16:03:31,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:31,260 INFO L225 Difference]: With dead ends: 542 [2025-01-09 16:03:31,261 INFO L226 Difference]: Without dead ends: 540 [2025-01-09 16:03:31,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:03:31,261 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 74 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:31,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 383 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:03:31,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-01-09 16:03:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-01-09 16:03:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 503 states have (on average 1.2246520874751492) internal successors, (616), 505 states have internal predecessors, (616), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 676 transitions. [2025-01-09 16:03:31,276 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 676 transitions. Word has length 111 [2025-01-09 16:03:31,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:31,276 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 676 transitions. [2025-01-09 16:03:31,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 676 transitions. [2025-01-09 16:03:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 16:03:31,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:31,277 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:31,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 16:03:31,278 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:31,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash -604718779, now seen corresponding path program 1 times [2025-01-09 16:03:31,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:31,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182381646] [2025-01-09 16:03:31,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:31,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:31,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:03:31,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:03:31,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:31,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:31,367 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 16:03:31,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:31,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182381646] [2025-01-09 16:03:31,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182381646] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:03:31,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261128868] [2025-01-09 16:03:31,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:31,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:31,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:31,369 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:03:31,371 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:03:31,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:03:31,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:03:31,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:31,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:31,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:03:31,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:31,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:31,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261128868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:31,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:03:31,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 16:03:31,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348413532] [2025-01-09 16:03:31,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:31,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:03:31,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:31,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:03:31,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:03:31,592 INFO L87 Difference]: Start difference. First operand 540 states and 676 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:31,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:31,616 INFO L93 Difference]: Finished difference Result 1089 states and 1365 transitions. [2025-01-09 16:03:31,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:03:31,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-01-09 16:03:31,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:31,619 INFO L225 Difference]: With dead ends: 1089 [2025-01-09 16:03:31,619 INFO L226 Difference]: Without dead ends: 552 [2025-01-09 16:03:31,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:03:31,620 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:31,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 453 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2025-01-09 16:03:31,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2025-01-09 16:03:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 515 states have (on average 1.2194174757281553) internal successors, (628), 517 states have internal predecessors, (628), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:31,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 688 transitions. [2025-01-09 16:03:31,637 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 688 transitions. Word has length 111 [2025-01-09 16:03:31,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:31,637 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 688 transitions. [2025-01-09 16:03:31,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:31,638 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 688 transitions. [2025-01-09 16:03:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 16:03:31,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:31,639 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:31,646 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:03:31,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:31,840 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:31,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:31,840 INFO L85 PathProgramCache]: Analyzing trace with hash -928133372, now seen corresponding path program 1 times [2025-01-09 16:03:31,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:31,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438033466] [2025-01-09 16:03:31,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:31,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:31,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:03:31,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:03:31,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:31,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:31,987 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:31,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:31,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438033466] [2025-01-09 16:03:31,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438033466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:31,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:31,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:03:31,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209966230] [2025-01-09 16:03:31,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:31,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:03:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:31,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:03:31,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:03:31,989 INFO L87 Difference]: Start difference. First operand 552 states and 688 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:32,170 INFO L93 Difference]: Finished difference Result 1236 states and 1538 transitions. [2025-01-09 16:03:32,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:03:32,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-01-09 16:03:32,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:32,174 INFO L225 Difference]: With dead ends: 1236 [2025-01-09 16:03:32,174 INFO L226 Difference]: Without dead ends: 687 [2025-01-09 16:03:32,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:03:32,176 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 30 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:32,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 306 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:03:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-01-09 16:03:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 554. [2025-01-09 16:03:32,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 517 states have (on average 1.2050290135396517) internal successors, (623), 519 states have internal predecessors, (623), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 683 transitions. [2025-01-09 16:03:32,191 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 683 transitions. Word has length 111 [2025-01-09 16:03:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:32,191 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 683 transitions. [2025-01-09 16:03:32,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 683 transitions. [2025-01-09 16:03:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 16:03:32,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:32,192 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:32,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 16:03:32,193 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:32,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:32,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1323077832, now seen corresponding path program 1 times [2025-01-09 16:03:32,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:32,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138001938] [2025-01-09 16:03:32,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:32,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:32,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:03:32,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:03:32,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:32,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:32,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:32,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138001938] [2025-01-09 16:03:32,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138001938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:32,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:32,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:03:32,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582335276] [2025-01-09 16:03:32,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:32,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:03:32,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:32,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:03:32,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:03:32,351 INFO L87 Difference]: Start difference. First operand 554 states and 683 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:32,574 INFO L93 Difference]: Finished difference Result 1211 states and 1494 transitions. [2025-01-09 16:03:32,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:03:32,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-01-09 16:03:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:32,578 INFO L225 Difference]: With dead ends: 1211 [2025-01-09 16:03:32,578 INFO L226 Difference]: Without dead ends: 660 [2025-01-09 16:03:32,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:03:32,579 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 29 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:32,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 396 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 16:03:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-09 16:03:32,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 554. [2025-01-09 16:03:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 517 states have (on average 1.193423597678917) internal successors, (617), 519 states have internal predecessors, (617), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 677 transitions. [2025-01-09 16:03:32,595 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 677 transitions. Word has length 111 [2025-01-09 16:03:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:32,595 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 677 transitions. [2025-01-09 16:03:32,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 677 transitions. [2025-01-09 16:03:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 16:03:32,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:32,597 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:32,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 16:03:32,598 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:32,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1209057816, now seen corresponding path program 1 times [2025-01-09 16:03:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:32,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25969359] [2025-01-09 16:03:32,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:32,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:03:32,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:03:32,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:32,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:03:32,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1802355933] [2025-01-09 16:03:32,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:32,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:32,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:32,653 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:03:32,654 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:03:32,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 16:03:32,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 16:03:32,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:32,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:32,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 16:03:32,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:32,906 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:03:32,911 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:03:32,916 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:03:32,919 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:03:32,925 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:03:32,930 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:03:32,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 37 treesize of output 21 [2025-01-09 16:03:32,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:32,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 39 [2025-01-09 16:03:33,008 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 112 treesize of output 86 [2025-01-09 16:03:33,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:33,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 126 [2025-01-09 16:03:33,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 55 [2025-01-09 16:03:33,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:33,343 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 139 treesize of output 65 [2025-01-09 16:03:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:33,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:33,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:33,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25969359] [2025-01-09 16:03:33,409 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 16:03:33,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802355933] [2025-01-09 16:03:33,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802355933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:33,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:33,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:03:33,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747883328] [2025-01-09 16:03:33,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:33,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:03:33,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:33,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:03:33,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:03:33,410 INFO L87 Difference]: Start difference. First operand 554 states and 677 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:33,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:33,937 INFO L93 Difference]: Finished difference Result 1149 states and 1404 transitions. [2025-01-09 16:03:33,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:03:33,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 111 [2025-01-09 16:03:33,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:33,942 INFO L225 Difference]: With dead ends: 1149 [2025-01-09 16:03:33,942 INFO L226 Difference]: Without dead ends: 598 [2025-01-09 16:03:33,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:03:33,944 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 46 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:33,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 709 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:03:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-01-09 16:03:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 550. [2025-01-09 16:03:33,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 513 states have (on average 1.1949317738791423) internal successors, (613), 515 states have internal predecessors, (613), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 16:03:33,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 673 transitions. [2025-01-09 16:03:33,958 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 673 transitions. Word has length 111 [2025-01-09 16:03:33,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:33,958 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 673 transitions. [2025-01-09 16:03:33,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:33,958 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 673 transitions. [2025-01-09 16:03:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 16:03:33,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:33,959 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:33,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 16:03:34,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:34,164 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:34,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:34,165 INFO L85 PathProgramCache]: Analyzing trace with hash -955203462, now seen corresponding path program 1 times [2025-01-09 16:03:34,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:34,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090126710] [2025-01-09 16:03:34,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:34,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:34,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:03:34,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:03:34,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:34,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:34,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:03:34,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090126710] [2025-01-09 16:03:34,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090126710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:34,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:34,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:03:34,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890279769] [2025-01-09 16:03:34,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:34,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:03:34,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:03:34,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:03:34,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:03:34,440 INFO L87 Difference]: Start difference. First operand 550 states and 673 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:34,614 INFO L93 Difference]: Finished difference Result 1218 states and 1481 transitions. [2025-01-09 16:03:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:03:34,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-01-09 16:03:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:34,616 INFO L225 Difference]: With dead ends: 1218 [2025-01-09 16:03:34,616 INFO L226 Difference]: Without dead ends: 671 [2025-01-09 16:03:34,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:03:34,617 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 40 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:34,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 725 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 16:03:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-01-09 16:03:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 667. [2025-01-09 16:03:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 622 states have (on average 1.1832797427652733) internal successors, (736), 626 states have internal predecessors, (736), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 16:03:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 804 transitions. [2025-01-09 16:03:34,633 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 804 transitions. Word has length 112 [2025-01-09 16:03:34,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:34,634 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 804 transitions. [2025-01-09 16:03:34,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 804 transitions. [2025-01-09 16:03:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 16:03:34,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:34,635 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:34,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 16:03:34,635 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:34,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:34,638 INFO L85 PathProgramCache]: Analyzing trace with hash -254138884, now seen corresponding path program 1 times [2025-01-09 16:03:34,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:03:34,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808679028] [2025-01-09 16:03:34,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:34,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:03:34,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:03:34,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:03:34,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:34,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 16:03:34,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1087907458] [2025-01-09 16:03:34,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:34,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:34,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:34,676 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:03:34,678 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:03:34,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:03:35,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:03:35,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:35,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:03:35,115 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:03:35,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 16:03:35,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 16:03:35,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:35,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:03:35,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:03:35,438 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:03:35,439 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 16:03:35,449 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:03:35,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:03:35,643 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, 1, 1, 1, 1, 1] [2025-01-09 16:03:35,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:03:35,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:03:35 BoogieIcfgContainer [2025-01-09 16:03:35,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:03:35,699 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:03:35,699 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:03:35,699 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:03:35,700 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:14" (3/4) ... [2025-01-09 16:03:35,702 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 16:03:35,702 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:03:35,703 INFO L158 Benchmark]: Toolchain (without parser) took 21689.41ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 132.8MB in the beginning and 325.5MB in the end (delta: -192.7MB). Peak memory consumption was 284.5MB. Max. memory is 16.1GB. [2025-01-09 16:03:35,703 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 226.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:03:35,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.67ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 117.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:03:35,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.30ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 114.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:03:35,703 INFO L158 Benchmark]: Boogie Preprocessor took 52.33ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 111.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:03:35,703 INFO L158 Benchmark]: RCFGBuilder took 512.65ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 84.5MB in the end (delta: 27.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:03:35,703 INFO L158 Benchmark]: TraceAbstraction took 20835.86ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 83.5MB in the beginning and 325.7MB in the end (delta: -242.2MB). Peak memory consumption was 234.2MB. Max. memory is 16.1GB. [2025-01-09 16:03:35,703 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 645.9MB. Free memory was 325.7MB in the beginning and 325.5MB in the end (delta: 170.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:03:35,706 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.22ms. Allocated memory is still 226.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.67ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 117.5MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.30ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 114.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.33ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 111.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 512.65ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 84.5MB in the end (delta: 27.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20835.86ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 83.5MB in the beginning and 325.7MB in the end (delta: -242.2MB). Peak memory consumption was 234.2MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 645.9MB. Free memory was 325.7MB in the beginning and 325.5MB in the end (delta: 170.8kB). 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 95, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 64. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -16, 0, 64, 64, -64, 32.5, 1.6, 32, 15.5, 0, 0 }; [L49] unsigned short int last_1_WrapperStruct00_var_1_10 = 32; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_10=32] [L108] isInitial = 1 [L109] FCALL initially() [L111] CALL updateLastVariables() [L101] EXPR WrapperStruct00.var_1_10 [L101] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L81] WrapperStruct00.var_1_3 = __VERIFIER_nondet_char() [L82] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L83] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L84] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L85] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L86] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L87] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L88] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L89] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L90] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L91] EXPR WrapperStruct00.var_1_8 [L91] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_8 [L91] EXPR WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L91] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L91] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L92] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L93] EXPR WrapperStruct00.var_1_9 [L93] EXPR WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_9 [L93] EXPR WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L93] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L94] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_11 [L95] EXPR WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_11 [L95] EXPR WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L95] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L96] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L98] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L112] RET updateVariables() [L113] CALL step() [L53] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L53] EXPR ((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10) [L53] EXPR WrapperStruct00.var_1_5 [L53] EXPR ((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L53] signed long int stepLocal_0 = (((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10)); [L54] EXPR WrapperStruct00.var_1_4 [L54] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32, stepLocal_0=63] [L54] EXPR last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32, stepLocal_0=63] [L54] COND TRUE stepLocal_0 <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3)) [L55] EXPR WrapperStruct00.var_1_8 [L55] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L55] COND TRUE (- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9 [L56] EXPR WrapperStruct00.var_1_4 [L56] WrapperStruct00.var_1_6 = WrapperStruct00.var_1_4 [L63] EXPR WrapperStruct00.var_1_5 [L63] EXPR WrapperStruct00.var_1_6 [L63] signed long int stepLocal_1 = WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6; [L64] EXPR WrapperStruct00.var_1_11 [L64] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32, stepLocal_1=125] [L64] COND FALSE !(WrapperStruct00.var_1_11 < WrapperStruct00.var_1_9) [L71] EXPR WrapperStruct00.var_1_13 [L71] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_13 [L72] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32, stepLocal_1=125] [L72] COND TRUE ! WrapperStruct00.var_1_12 [L73] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32, stepLocal_1=125] [L73] COND TRUE ! WrapperStruct00.var_1_12 [L74] EXPR WrapperStruct00.var_1_3 [L74] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_3 + -32) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1 [L104] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16)))))) [L104] EXPR WrapperStruct00.var_1_1 [L104] EXPR WrapperStruct00.var_1_3 [L104] EXPR (! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) [L104] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10) [L104] EXPR WrapperStruct00.var_1_5 [L104] EXPR ((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR WrapperStruct00.var_1_4 [L104] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)) [L104] EXPR WrapperStruct00.var_1_8 [L104] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)) [L104] EXPR WrapperStruct00.var_1_6 [L104] EXPR WrapperStruct00.var_1_5 [L104] EXPR ((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR (((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)))) && ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_9) ? (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6) <= (~ (WrapperStruct00.var_1_6 % -32))) ? (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104] EXPR ((((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)))) && ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_9) ? (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6) <= (~ (WrapperStruct00.var_1_6 % -32))) ? (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5))) : 1)) && (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L104-L105] return ((((! WrapperStruct00.var_1_12) ? ((! WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_3 + -32))) : (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - ((((WrapperStruct00.var_1_5) < (16)) ? (WrapperStruct00.var_1_5) : (16))))))) : 1) && ((((((WrapperStruct00.var_1_5) > (last_1_WrapperStruct00_var_1_10)) ? (WrapperStruct00.var_1_5) : (last_1_WrapperStruct00_var_1_10))) <= (WrapperStruct00.var_1_4 * (last_1_WrapperStruct00_var_1_10 >> WrapperStruct00.var_1_3))) ? (((- WrapperStruct00.var_1_8) >= WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_4)) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6 == ((signed long int) WrapperStruct00.var_1_5)))) && ((WrapperStruct00.var_1_11 < WrapperStruct00.var_1_9) ? (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6) <= (~ (WrapperStruct00.var_1_6 % -32))) ? (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5)) : (WrapperStruct00.var_1_10 == ((unsigned short int) WrapperStruct00.var_1_5))) : 1)) && (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_13)) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.7s, OverallIterations: 26, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2347 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2336 mSDsluCounter, 11297 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8472 mSDsCounter, 339 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6213 IncrementalHoareTripleChecker+Invalid, 6552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 339 mSolverCounterUnsat, 2825 mSDtfsCounter, 6213 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1114 GetRequests, 928 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=667occurred in iteration=25, InterpolantAutomatonStates: 189, 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, 25 MinimizatonAttempts, 1647 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 3759 NumberOfCodeBlocks, 3759 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3064 ConstructedInterpolants, 0 QuantifiedInterpolants, 11015 SizeOfPredicates, 17 NumberOfNonLiveVariables, 3238 ConjunctsInSsa, 161 ConjunctsInUnsatCore, 29 InterpolantComputations, 25 PerfectInterpolantSequences, 6351/6380 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:03:35,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-79.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 f7fc08b588cf858e0c335544f00bb02bd00acd3c7c4757ecff13aa4df92c2d34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:03:37,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:03:37,999 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:03:38,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:03:38,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:03:38,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:03:38,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:03:38,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:03:38,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:03:38,031 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:03:38,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:03:38,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:03:38,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:03:38,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:03:38,033 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:03:38,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:03:38,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:03:38,033 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:03:38,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:03:38,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:03:38,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:03:38,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:03:38,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:03:38,034 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 16:03:38,034 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 16:03:38,034 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 16:03:38,034 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:03:38,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:03:38,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:03:38,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:03:38,034 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:03:38,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:03:38,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:38,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:38,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:03:38,035 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7fc08b588cf858e0c335544f00bb02bd00acd3c7c4757ecff13aa4df92c2d34 [2025-01-09 16:03:38,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:03:38,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:03:38,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:03:38,308 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:03:38,308 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:03:38,309 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-79.i [2025-01-09 16:03:39,517 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f0eb3e97/76703ed5dae342f59958bb2e22b20e4c/FLAG9ac9e8ce6 [2025-01-09 16:03:39,723 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:03:39,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-79.i [2025-01-09 16:03:39,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f0eb3e97/76703ed5dae342f59958bb2e22b20e4c/FLAG9ac9e8ce6 [2025-01-09 16:03:40,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f0eb3e97/76703ed5dae342f59958bb2e22b20e4c [2025-01-09 16:03:40,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:03:40,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:03:40,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:03:40,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:03:40,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:03:40,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:40" (1/1) ... [2025-01-09 16:03:40,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377f793b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:40, skipping insertion in model container [2025-01-09 16:03:40,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:03:40" (1/1) ... [2025-01-09 16:03:40,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:03:40,197 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-79.i[916,929] [2025-01-09 16:03:40,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:40,249 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:03:40,257 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-79.i[916,929] [2025-01-09 16:03:40,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:03:40,312 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:03:40,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:40 WrapperNode [2025-01-09 16:03:40,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:03:40,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:40,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:03:40,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:03:40,319 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:03:40" (1/1) ... [2025-01-09 16:03:40,328 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:03:40" (1/1) ... [2025-01-09 16:03:40,348 INFO L138 Inliner]: procedures = 40, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 384 [2025-01-09 16:03:40,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:03:40,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:03:40,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:03:40,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:03:40,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:40" (1/1) ... [2025-01-09 16:03:40,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:40" (1/1) ... [2025-01-09 16:03:40,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:40" (1/1) ... [2025-01-09 16:03:40,378 INFO L175 MemorySlicer]: Split 104 memory accesses to 2 slices as follows [2, 102]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27]. [2025-01-09 16:03:40,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:40" (1/1) ... [2025-01-09 16:03:40,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:40" (1/1) ... [2025-01-09 16:03:40,390 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:40" (1/1) ... [2025-01-09 16:03:40,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:40" (1/1) ... [2025-01-09 16:03:40,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:40" (1/1) ... [2025-01-09 16:03:40,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:40" (1/1) ... [2025-01-09 16:03:40,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:40" (1/1) ... [2025-01-09 16:03:40,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:03:40,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:03:40,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:03:40,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:03:40,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:40" (1/1) ... [2025-01-09 16:03:40,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:03:40,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:03:40,429 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:03:40,431 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:03:40,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:03:40,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 16:03:40,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 16:03:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-01-09 16:03:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-01-09 16:03:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 16:03:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 16:03:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 16:03:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 16:03:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 16:03:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 16:03:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 16:03:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 16:03:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 16:03:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 16:03:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 16:03:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 16:03:40,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 16:03:40,446 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:03:40,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 16:03:40,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 16:03:40,545 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:03:40,546 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:03:41,448 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2025-01-09 16:03:41,448 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:03:41,455 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:03:41,455 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:03:41,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:41 BoogieIcfgContainer [2025-01-09 16:03:41,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:03:41,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:03:41,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:03:41,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:03:41,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:03:40" (1/3) ... [2025-01-09 16:03:41,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6990a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:41, skipping insertion in model container [2025-01-09 16:03:41,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:03:40" (2/3) ... [2025-01-09 16:03:41,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6990a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:03:41, skipping insertion in model container [2025-01-09 16:03:41,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:03:41" (3/3) ... [2025-01-09 16:03:41,461 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-79.i [2025-01-09 16:03:41,470 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:03:41,471 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-79.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 16:03:41,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:03:41,511 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;@4c967890, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:03:41,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 16:03:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 16:03:41,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:41,530 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:41,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:41,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:41,536 INFO L85 PathProgramCache]: Analyzing trace with hash 830164200, now seen corresponding path program 1 times [2025-01-09 16:03:41,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:41,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765789317] [2025-01-09 16:03:41,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:41,545 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:03:41,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:41,549 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:03:41,550 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:03:41,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 16:03:41,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 16:03:41,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:41,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:41,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 16:03:41,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-01-09 16:03:41,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:41,871 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:41,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765789317] [2025-01-09 16:03:41,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765789317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:41,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:41,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:03:41,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174111289] [2025-01-09 16:03:41,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:41,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:03:41,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:41,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:03:41,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:03:41,891 INFO L87 Difference]: Start difference. First operand has 90 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:41,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:41,907 INFO L93 Difference]: Finished difference Result 174 states and 266 transitions. [2025-01-09 16:03:41,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:03:41,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2025-01-09 16:03:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:41,912 INFO L225 Difference]: With dead ends: 174 [2025-01-09 16:03:41,912 INFO L226 Difference]: Without dead ends: 87 [2025-01-09 16:03:41,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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:03:41,915 INFO L435 NwaCegarLoop]: 125 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, 125 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:03:41,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:41,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-09 16:03:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-01-09 16:03:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2025-01-09 16:03:41,937 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 100 [2025-01-09 16:03:41,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:41,937 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2025-01-09 16:03:41,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2025-01-09 16:03:41,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 16:03:41,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:41,939 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:41,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 16:03:42,147 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:03:42,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:42,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash 390379886, now seen corresponding path program 1 times [2025-01-09 16:03:42,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:42,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252666558] [2025-01-09 16:03:42,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:42,151 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:03:42,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:42,154 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:03:42,155 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:03:42,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 16:03:42,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 16:03:42,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:42,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:42,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:03:42,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:42,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:42,373 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:42,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252666558] [2025-01-09 16:03:42,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252666558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:42,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:42,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:03:42,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461403638] [2025-01-09 16:03:42,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:42,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:42,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:42,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:42,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:42,375 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:42,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:42,403 INFO L93 Difference]: Finished difference Result 173 states and 250 transitions. [2025-01-09 16:03:42,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:42,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2025-01-09 16:03:42,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:42,408 INFO L225 Difference]: With dead ends: 173 [2025-01-09 16:03:42,408 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 16:03:42,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 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:03:42,409 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 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:03:42,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 16:03:42,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 16:03:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:42,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2025-01-09 16:03:42,418 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 100 [2025-01-09 16:03:42,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:42,422 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2025-01-09 16:03:42,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:42,422 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2025-01-09 16:03:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 16:03:42,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:42,423 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:42,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:03:42,623 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:03:42,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:42,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:42,626 INFO L85 PathProgramCache]: Analyzing trace with hash 246416713, now seen corresponding path program 1 times [2025-01-09 16:03:42,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:42,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275463869] [2025-01-09 16:03:42,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:42,627 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:03:42,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:42,629 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:03:42,631 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:03:42,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 16:03:42,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 16:03:42,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:42,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:42,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:03:42,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:42,875 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:03:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:42,923 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:42,923 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:42,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275463869] [2025-01-09 16:03:42,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275463869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:42,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:42,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:03:42,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138325723] [2025-01-09 16:03:42,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:42,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:03:42,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:42,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:03:42,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:03:42,925 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:45,935 INFO L93 Difference]: Finished difference Result 251 states and 359 transitions. [2025-01-09 16:03:45,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:03:45,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2025-01-09 16:03:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:45,937 INFO L225 Difference]: With dead ends: 251 [2025-01-09 16:03:45,937 INFO L226 Difference]: Without dead ends: 165 [2025-01-09 16:03:45,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 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:03:45,938 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 94 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:45,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 504 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 16:03:45,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-01-09 16:03:45,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 91. [2025-01-09 16:03:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 78 states have internal predecessors, (107), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:45,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2025-01-09 16:03:45,946 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 102 [2025-01-09 16:03:45,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:45,946 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2025-01-09 16:03:45,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2025-01-09 16:03:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:03:45,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:45,948 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:45,954 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:03:46,152 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:03:46,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:46,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:46,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1872002135, now seen corresponding path program 1 times [2025-01-09 16:03:46,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:46,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127425131] [2025-01-09 16:03:46,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:46,153 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:03:46,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:46,156 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:03:46,162 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:03:46,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:03:46,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:03:46,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:46,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:46,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:03:46,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:46,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:46,370 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:46,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127425131] [2025-01-09 16:03:46,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127425131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:46,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:46,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:03:46,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006332094] [2025-01-09 16:03:46,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:46,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:03:46,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:46,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:03:46,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:03:46,371 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:46,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:46,401 INFO L93 Difference]: Finished difference Result 184 states and 262 transitions. [2025-01-09 16:03:46,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:03:46,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-01-09 16:03:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:46,402 INFO L225 Difference]: With dead ends: 184 [2025-01-09 16:03:46,402 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 16:03:46,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 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:03:46,403 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:46,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 467 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 16:03:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 16:03:46,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-01-09 16:03:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2025-01-09 16:03:46,408 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 103 [2025-01-09 16:03:46,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:46,408 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2025-01-09 16:03:46,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2025-01-09 16:03:46,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 16:03:46,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:46,410 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:46,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-01-09 16:03:46,613 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:03:46,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:46,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:46,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1873849177, now seen corresponding path program 1 times [2025-01-09 16:03:46,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:46,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623355601] [2025-01-09 16:03:46,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:46,615 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:03:46,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:46,620 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:03:46,621 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:03:46,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 16:03:46,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 16:03:46,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:46,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:46,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 16:03:46,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:46,940 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:03:47,204 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:03:47,357 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:03:47,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:47,602 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 51 treesize of output 27 [2025-01-09 16:03:47,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:47,743 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 46 treesize of output 37 [2025-01-09 16:03:49,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:49,761 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:03:49,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:49,906 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:03:50,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:50,135 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:03:50,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:50,181 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 52 treesize of output 60 [2025-01-09 16:03:50,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:50,291 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 71 treesize of output 76 [2025-01-09 16:03:50,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:50,464 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 119 treesize of output 59 [2025-01-09 16:03:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 126 proven. 54 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 16:03:50,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:03:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:50,673 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:50,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623355601] [2025-01-09 16:03:50,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623355601] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:03:50,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:03:50,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 21 [2025-01-09 16:03:50,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226067249] [2025-01-09 16:03:50,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:50,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:03:50,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:50,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:03:50,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=345, Unknown=1, NotChecked=0, Total=420 [2025-01-09 16:03:50,675 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:51,343 INFO L93 Difference]: Finished difference Result 226 states and 314 transitions. [2025-01-09 16:03:51,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:03:51,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2025-01-09 16:03:51,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:51,345 INFO L225 Difference]: With dead ends: 226 [2025-01-09 16:03:51,345 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 16:03:51,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=86, Invalid=465, Unknown=1, NotChecked=0, Total=552 [2025-01-09 16:03:51,346 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 41 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:51,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 585 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:03:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 16:03:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 99. [2025-01-09 16:03:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2025-01-09 16:03:51,351 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 103 [2025-01-09 16:03:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:51,352 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2025-01-09 16:03:51,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2025-01-09 16:03:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 16:03:51,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:51,353 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:51,369 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:03:51,553 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:03:51,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:51,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:51,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1142279841, now seen corresponding path program 1 times [2025-01-09 16:03:51,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:51,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77745753] [2025-01-09 16:03:51,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:51,559 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:03:51,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:51,561 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:03:51,561 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:03:51,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 16:03:51,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 16:03:51,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:51,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:51,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 16:03:51,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:51,811 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:03:51,928 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 41 treesize of output 19 [2025-01-09 16:03:51,963 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 34 treesize of output 16 [2025-01-09 16:03:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-09 16:03:51,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:51,979 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:51,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77745753] [2025-01-09 16:03:51,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77745753] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:51,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:51,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:03:51,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254134941] [2025-01-09 16:03:51,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:51,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:03:51,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:51,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:03:51,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:03:51,980 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 16:03:53,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:53,441 INFO L93 Difference]: Finished difference Result 199 states and 278 transitions. [2025-01-09 16:03:53,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:03:53,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2025-01-09 16:03:53,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:53,442 INFO L225 Difference]: With dead ends: 199 [2025-01-09 16:03:53,442 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 16:03:53,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:03:53,443 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 89 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:53,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 246 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 16:03:53,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 16:03:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2025-01-09 16:03:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 139 transitions. [2025-01-09 16:03:53,457 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 139 transitions. Word has length 104 [2025-01-09 16:03:53,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:53,457 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 139 transitions. [2025-01-09 16:03:53,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 16:03:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 139 transitions. [2025-01-09 16:03:53,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 16:03:53,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:53,460 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:53,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-01-09 16:03:53,661 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:03:53,661 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:53,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:53,661 INFO L85 PathProgramCache]: Analyzing trace with hash -330332781, now seen corresponding path program 1 times [2025-01-09 16:03:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:53,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443046661] [2025-01-09 16:03:53,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:53,662 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:03:53,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:53,665 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:03:53,666 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:03:53,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 16:03:53,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 16:03:53,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:53,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:53,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:03:53,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:53,851 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:53,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:53,851 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:53,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443046661] [2025-01-09 16:03:53,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443046661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:53,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:53,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:03:53,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916098797] [2025-01-09 16:03:53,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:53,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:53,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:53,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:53,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:53,852 INFO L87 Difference]: Start difference. First operand 101 states and 139 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:54,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:54,210 INFO L93 Difference]: Finished difference Result 197 states and 272 transitions. [2025-01-09 16:03:54,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:54,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2025-01-09 16:03:54,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:54,212 INFO L225 Difference]: With dead ends: 197 [2025-01-09 16:03:54,212 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 16:03:54,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 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:03:54,213 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:54,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 16:03:54,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 16:03:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 16:03:54,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 85 states have internal predecessors, (112), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 134 transitions. [2025-01-09 16:03:54,219 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 134 transitions. Word has length 105 [2025-01-09 16:03:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:54,219 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 134 transitions. [2025-01-09 16:03:54,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 134 transitions. [2025-01-09 16:03:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 16:03:54,220 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:54,220 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:54,228 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:03:54,422 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:03:54,422 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:54,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:54,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1972182253, now seen corresponding path program 1 times [2025-01-09 16:03:54,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:54,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94180946] [2025-01-09 16:03:54,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:54,424 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:03:54,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:54,425 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:03:54,426 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:03:54,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 16:03:54,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 16:03:54,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:54,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:54,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 16:03:54,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:54,728 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:03:54,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 16:03:54,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2025-01-09 16:03:54,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:54,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 51 [2025-01-09 16:03:54,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:03:54,848 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 58 treesize of output 24 [2025-01-09 16:03:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 16:03:54,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:54,875 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:54,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94180946] [2025-01-09 16:03:54,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94180946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:54,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:54,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:03:54,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353402403] [2025-01-09 16:03:54,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:54,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:03:54,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:54,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:03:54,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:03:54,876 INFO L87 Difference]: Start difference. First operand 99 states and 134 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:56,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:56,138 INFO L93 Difference]: Finished difference Result 221 states and 298 transitions. [2025-01-09 16:03:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:03:56,139 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2025-01-09 16:03:56,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:56,141 INFO L225 Difference]: With dead ends: 221 [2025-01-09 16:03:56,141 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 16:03:56,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:03:56,142 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 140 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:56,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 329 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 16:03:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 16:03:56,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2025-01-09 16:03:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2025-01-09 16:03:56,150 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 132 transitions. Word has length 105 [2025-01-09 16:03:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:56,150 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 132 transitions. [2025-01-09 16:03:56,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-01-09 16:03:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 132 transitions. [2025-01-09 16:03:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 16:03:56,151 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:56,151 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:56,162 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:03:56,356 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:03:56,356 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:56,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:56,357 INFO L85 PathProgramCache]: Analyzing trace with hash 140628319, now seen corresponding path program 1 times [2025-01-09 16:03:56,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:56,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183218931] [2025-01-09 16:03:56,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:56,357 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:03:56,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:56,362 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:03:56,364 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:03:56,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 16:03:56,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 16:03:56,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:56,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:56,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 16:03:56,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:03:56,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:03:56,561 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:03:56,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183218931] [2025-01-09 16:03:56,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183218931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:03:56,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:03:56,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:03:56,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92029493] [2025-01-09 16:03:56,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:03:56,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:03:56,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:03:56,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:03:56,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:03:56,564 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:03:56,976 INFO L93 Difference]: Finished difference Result 185 states and 249 transitions. [2025-01-09 16:03:56,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:03:56,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2025-01-09 16:03:56,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:03:56,977 INFO L225 Difference]: With dead ends: 185 [2025-01-09 16:03:56,977 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 16:03:56,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 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:03:56,978 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 16:03:56,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 16:03:56,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 16:03:56,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 16:03:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 75 states have internal predecessors, (97), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 16:03:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2025-01-09 16:03:56,983 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 105 [2025-01-09 16:03:56,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:03:56,983 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2025-01-09 16:03:56,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:03:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2025-01-09 16:03:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 16:03:56,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:03:56,984 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:56,993 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 (10)] Forceful destruction successful, exit code 0 [2025-01-09 16:03:57,185 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:03:57,185 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:03:57,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:03:57,185 INFO L85 PathProgramCache]: Analyzing trace with hash 257710024, now seen corresponding path program 1 times [2025-01-09 16:03:57,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:03:57,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556101668] [2025-01-09 16:03:57,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:03:57,186 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:03:57,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:03:57,189 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:03:57,190 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:03:57,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 16:03:57,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 16:03:57,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:03:57,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:03:57,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 16:03:57,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:03:57,507 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:03:57,515 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 20 treesize of output 21 [2025-01-09 16:03:59,983 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_53| (_ BitVec 64))) (let ((.cse0 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_53|) (select .cse0 (bvadd (_ bv8 32) |c_~#WrapperStruct00~0.offset|))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_53|) (select .cse0 (bvadd (_ bv12 32) |c_~#WrapperStruct00~0.offset|)))))) is different from true [2025-01-09 16:04:00,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:00,062 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 51 treesize of output 27 [2025-01-09 16:04:00,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:00,123 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:04:00,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:00,180 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:04:00,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:00,335 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 52 treesize of output 60 [2025-01-09 16:04:00,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:00,395 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 69 treesize of output 74 [2025-01-09 16:04:00,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:00,461 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 83 treesize of output 100 [2025-01-09 16:04:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 24 not checked. [2025-01-09 16:04:00,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:04:00,866 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:00,866 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:04:00,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556101668] [2025-01-09 16:04:00,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556101668] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:04:00,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:04:00,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2025-01-09 16:04:00,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514847883] [2025-01-09 16:04:00,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:00,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:04:00,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:04:00,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:04:00,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=82, Unknown=1, NotChecked=18, Total=132 [2025-01-09 16:04:00,867 INFO L87 Difference]: Start difference. First operand 89 states and 119 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 16:04:01,533 INFO L93 Difference]: Finished difference Result 226 states and 299 transitions. [2025-01-09 16:04:01,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:04:01,535 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2025-01-09 16:04:01,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 16:04:01,540 INFO L225 Difference]: With dead ends: 226 [2025-01-09 16:04:01,540 INFO L226 Difference]: Without dead ends: 140 [2025-01-09 16:04:01,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=43, Invalid=142, Unknown=1, NotChecked=24, Total=210 [2025-01-09 16:04:01,541 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 43 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 16:04:01,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 484 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 16:04:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-09 16:04:01,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2025-01-09 16:04:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 118 states have (on average 1.271186440677966) internal successors, (150), 119 states have internal predecessors, (150), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 16:04:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 180 transitions. [2025-01-09 16:04:01,555 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 180 transitions. Word has length 107 [2025-01-09 16:04:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 16:04:01,556 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 180 transitions. [2025-01-09 16:04:01,557 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 180 transitions. [2025-01-09 16:04:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 16:04:01,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 16:04:01,558 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:01,570 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:04:01,762 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:04:01,762 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:04:01,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:04:01,764 INFO L85 PathProgramCache]: Analyzing trace with hash 949938753, now seen corresponding path program 1 times [2025-01-09 16:04:01,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 16:04:01,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128301073] [2025-01-09 16:04:01,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:04:01,764 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:04:01,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 16:04:01,767 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:04:01,769 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:04:01,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 16:04:02,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 16:04:02,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:04:02,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:04:02,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 16:04:02,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:04:02,065 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 47 treesize of output 10 [2025-01-09 16:04:02,093 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 29 treesize of output 17 [2025-01-09 16:04:02,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 16:04:02,113 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:04:02,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-01-09 16:04:02,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:02,480 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 32 [2025-01-09 16:04:02,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:02,573 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 52 [2025-01-09 16:04:06,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:06,380 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 60 treesize of output 53 [2025-01-09 16:04:06,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:06,504 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 55 treesize of output 63 [2025-01-09 16:04:07,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:07,366 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 114 treesize of output 95 [2025-01-09 16:04:07,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:07,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 116 treesize of output 106 [2025-01-09 16:04:07,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:07,901 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 108 treesize of output 119 [2025-01-09 16:04:08,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:04:08,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 65 [2025-01-09 16:04:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 182 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 16:04:09,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:04:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-09 16:04:10,583 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 16:04:10,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128301073] [2025-01-09 16:04:10,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128301073] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:04:10,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:04:10,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [20] total 26 [2025-01-09 16:04:10,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014001961] [2025-01-09 16:04:10,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:04:10,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:04:10,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 16:04:10,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:04:10,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=507, Unknown=1, NotChecked=0, Total=650 [2025-01-09 16:04:10,584 INFO L87 Difference]: Start difference. First operand 137 states and 180 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-01-09 16:04:16,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:20,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:23,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:28,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:31,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:35,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 16:04:39,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.92s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []